I dont understand what to do with this.

1) Represent the linear programing problem below by an initial Simplex Tableau

Maximise P=15x-4y-4z

Subject to 10x-4y+8z <(or equal to) 40

10x+6y+9z <(or equal to) 72

-6x+4y+3z<(or equal to) 48

and x>(or equal to) 0, y> (or equal to) 0, z> (or equal to) 0

2) perform one iteration of the simplex algorithm and write down the values of x,y, z and P that result from the iteration

3) Perform one further iteration of the simplex algorithm and find the values of x, y, z and P at the optimum point