Assume that the size after joining R1 and R2 is B(RI R2) B(R) B(R2)*0.01 and we want to join five tables A, B, C, D, E, using a left-deep tree in the order of A BC D E. The sizes of them are B(A) 200, B(B) 300, B(C) 700, B(D)- 400, B(E) 100. What will be the minimal required memory we must have if we allow materializing the intermediate results? If we do not allow materialization and we want to pipeline (the output from previous step will feed directly as the input to the next step) all the intermediate steps, how much memory must we have? Assume that we use simple hash-join, which means that, for joining two tables (they could be the original tables or intermediate results), we always have one of them hashed and stored entirely in memory, and then we read from the other table one block at a time to join with the hashed table in memory. Notice that order of siblings in the same subtree does not matter, meaning that A D