Need help with a Python problem

Please note that when you enumerate all possible combinations for a partitioning of basic and nonbasic variables, some combinations will create a singular basic matrix, whereas some others would be infeasible. A basic solution is infeasible if one or more of the basic variables are negative. You are required to use the following in your code: 1) Recipe number 4 from class notes in file linked as Python Recipes. This code recipe extracts specified columns from a larger matrix. 2) Visit ActiveState's cookbook web site. Search for recipes that provide functions to enumerate all given combinations of a larger set. Use this code to enumerate all possible BFSs. 3) Use the [login to view URL]() function from Scipy library to solve for the values of basic variables. Randomly generate an LP with 20 variables, and 5 constraints. That means you need to generate a 5 by 20 A matrix, a b vector with 5 elements, and a c vector with 20 elements. Solve this randomly generated instance with your algorithm. Choose the sense of optimization arbitrarily. Deliverables listed in one file: 1) Your source code that implements the algorithm. 2) A listing of your A, b, and c values. 3) The total number of combinations you enumerated decomposed by: number of invalid combinations (singular B matrix), number of infeasible solutions, and number that are valid BFSs. 4) Show the optimal solution. Please note that you may not be able to create a feasible LP model in your first attempt. In that case , continue to create instances, randomly, until you find one with at least one feasible solution.