Consider the following optimal simplex tableau, which has arisen from a maximization problem.

$\backslash$table$[[z,x_1,x_2,x_3,x_4,x_5,$R$.$H$.$S$.],[1,0,1,0,0,5,10],[0,1,\frac{1}{2},1,0,2,7],[0,0,-1,-2,1,1,5]]$

Write down the optimal basic feasible solution displayed in this table, and then compute a different optimal basic feasible solution. Hence write down an infinite family of optimal solutions.