Please do not copy other solutions. Thank you very much in advance!

Product(pname, maker, price). Consider the SQL query: SELECT c.cname, c.president FROM Company c, Product p WHERE (c.cname-p.maker) AND (p.price 100) AND (c.city 'Madison') (a) Draw a logical query plan tree for the above SQL query. This plan tree should join Company and Product, then perform a selection on price and city, then project out cname and president. (b) Consider the logical query plan that you have drawn in Part a. Draw a new logical query plan that pushes selections and projections down as far as possible. Please state also the rules that you have applied (c) Given the following information: T(Company) 2000 records T(Product) - 20000 records B(Company) 200 pages B(Product) -200 pages Product, price) = 2500 V(Product, city) -40 You always used the block-nested loop join. Both relations are clustered M = 100 (pages) Please calculate IO cost for each query plan in (a) and (b)