Work in groups of $3-5$ or individually if you like. If you work in a group, turn in only $1$ copy with everyone's name on it$.$ Note, that it would be best to do #$3$ on a separate sheet of paper.

Given the following SQL statement:

SELECT FNAME, LNAME, SALARY

FROM EMPLOYEE, WORKS$\_$ON$,$ PROJECT

WHERE SSN $=$ ESSN AND PNO $=$ PNUMBER AND PNAME $=$ 'Product x$\text{'}$;

Show what the relational algebra version would look like.

What would the initial $($canonical$)$ query tree look like?

Show how the initial tree would be optimized. That is$,$ for each step where there is a change, draw the query tree after that step is applied.