(Solved): please don't use previous problem answer, they're not similar. Assignment: Relational Algebra Query ...

Assignment: Relational Algebra Query Tree Optimization Purpose This assignment will assess your ability to 1. Transform queries into more efficient forms using the relational model. 2. Apply heuristic rules to optimize queries. Specification Given the following relations: PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP_CODES(Zip, City, State) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) Where Qoh stands for quantity on hand and Olevel stands for (re)order Level. The P, C,E single letter prefixes for attributes refer to the parts, customers, employees, and orders \( r \) respectively. The other attribute names are self-explanatory. 1. Write the query (SQL or relational algebra query) for the following task: a. Retrieve the name of the customers who have ordered parts costing more than \( \$ 100.00 \), and the part names. 2. For the above query you generated, do the following: a. Use any available drawing tool (https://www.draw.io/ is a free tool) to draw an initial relational algebra query tree (Refer to P38 (a) tree). b. Transform the initial query tree created above into more efficient forms using the heuristic rules (follow the example on the Presentation slides from P39 to P44 tree (b), (c), (d) \& (e)). Show your optimization one step at a time and explain the rationale of each optimization.