Question No$.01(20$ Points$)$

The rows of given matrix $S$ represent the basic solutions of a linear optimization problem. Write a MATLAB code to add two extra columns of all entries equal to zero. Then the code must identify the type of solution by storing $-1$ or $1$ or $0$ in the $2^{nd}$ last column infeasible, $0=$ degenerative, $1=$ non$-$degenerative