The following LP problem was solved using the simplex algorithm:Maximize $212+23$Subject to $21+2101+2223202+23510,20,30$The simplex table is given as:Basis $1234560301011511120120055052012112030121001252($a$)$ List the binding and non$-$binding constraints with reasoning.$($b$)$ If the right$-$hand side of constraints $1$ and $2$ are changed to $15$ and $15$ instead of $10$ and$20,$ calculate the revised solution and variables. Will the basis change?$($c$)$ If the right$-$hand side of constraints $2$ and $3$ are changed to $5$ and $0$ instead of $20$ and $5,$calculate the revised solution and variables. Will the basis change?