Implement the Revised Simplex Method using a programming language such as C$,$ Java or Python. The implementation should have the following features:

$1.$ All steps of the Revised Simplex included

$2.$ Ability to solve LPs with all types of constraints $(>=,<=,==),$ objective functions $($min or max$)$ and upper and lower bounds on the variables

$3.$ Takes input through a graphical interface or input file in txt or csv format

$4.$ Prints the iterations

$5.$ Report the result as: Optimal, Infeasible, Unbounded

$6.$ Prints the optimal solution as Z$*$ and x$*$ and optimal B$-1.$