Solve the following linear programming problem by simplex method

$$\eqalign{ & Maximize\,\,\,\,\,\,4{x_1} + 6{x_2} + {x_3} \cr & Subject\,\,to\,\,\,\,\,\,2{x_1} - {x_2} + 3{x_3}\, \le 5 \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,{x_1},{x_2},{x_3} \ge 0 \cr} $$

$$(a)$$$$\,\,\,\,\,\,\,$$ What is the solution to the above problem?

$$(b)$$$$\,\,\,\,\,\,\,$$ Add the constant $${x_2} \le 2$$ to the simplex table of part $$(a)$$ and find the solution.