3. A linear program in standard inequality form has coefficient matrix A which is of full row rank m, RHS vector b and is known to have a finite optimal solution. Compute all m x m invertible matrices B1, B2, ..., Bk such that B:16 > 0 for all i 1, 2, ..., k. Then identify the best BFS generated by these matrices. Will the resulting solution be optimal to the linear program? Justify your answer. 3. A linear program in standard inequality form has coefficient matrix A which is of full row rank m, RHS vector b and is known to have a finite optimal solution. Compute all m x m invertible matrices B1, B2, ..., Bk such that B:16 > 0 for all i 1, 2, ..., k. Then identify the best BFS generated by these matrices. Will the resulting solution be optimal to the linear program? Justify your