a) T(n) = T(n – 1) + 2" , T(1) = 1 n b) T(n) = 3T () + n², T(n) = 1 for n < 10 c) T(n) = T()+ T +n, T(n) = 1 for n < 10 3.

Question 20 Please fill in the blank correctly.

Which of these statements is true about relation partitioning?     It places different rows from the same table on different machines, allowing for the computing of different query predicates in parallel on different machines.   It places different columns from the same table on different machines, which allows for computing different query predicates in parallel on different machines.   It places certain tables on one machine and others on a different machine, allowing different query subexpressions in the same plan to be computed in parallel on different machines.   It replicates and indexes data, which generally improves query performance.

explain the topic of Relational algebra Selection and Projection