Problem
1. Modify the traffic flow problem in linear algebra to add a node so that there are 5 equations. Determine the rank of such a system and derive the solution. Use 3 sample digit (Ex: - 7,4,9) as one of the new parameters and alter the old ones. Justify.
2. Given a matrix A, count the maximum number of additions, multiplications and divisions required to find the rank of A using the elementary row operations.