For the four relations in the following table, find the best join order according to the dynamic programming algorithm used in System-R. You should give the dynamic programming table entries for evaluate the join orders. Assume that the cost of each join is the size of its intermediate result. Suppose that we are only interested in left-deep join trees and join trees without Cartesian products. Note that you should use the System-R optimizer formula to compute the size of each join output. R(A,B,C) S(B,C) TR-4000 | T(S)=3000 | T(W)-2000 | TU-1000 VR.A) =100 V(R,B) =200 | V(S,B) =100 | V(W,B) =100 V(R,C)-100 V(S,C)-300 U(A,D) V(U,A) =100 V(W.D)-50 V(U,D)-100 For the four relations in the following table, find the best join order according to the dynamic programming algorithm used in System-R. You should give the dynamic programming table entries for evaluate the join orders. Assume that the cost of each join is the size of its intermediate result. Suppose that we are only interested in left-deep join trees and join trees without Cartesian products. Note that you should use the System-R optimizer formula to compute the size of each join output. R(A,B,C) S(B,C) TR-4000 | T(S)=3000 | T(W)-2000 | TU-1000 VR.A) =100 V(R,B) =200 | V(S,B) =100 | V(W,B) =100 V(R,C)-100 V(S,C)-300 U(A,D) V(U,A) =100 V(W.D)-50 V(U,D)-100