Select ALL the following statements that are FALSE on multi$-$relation queries. $[5$ points$]$

a$.$ The number of equivalent query trees grows rapidly as the number of aggregation operators in

a multi$-$relation query increases.

b$.$ A query that joins n relations will have at most $($n$-1)$ join operations that could be rearranged

in n$!$ different join orders.

c$.$ A left$-$deep join tree is a binary tree in which the left child of each non$-$leaf node is always a

base relation.

d$.$ It is easier to apply pipelining on a left$/$right$-$deep join tree than a bushy join tree.

e$.$ The order in which joins are executed in a query is NOT something that the database$$s query

optimizer concerns with