4. Here are the statistics for four relations E, F, G, and H: E(a, b, c) T(E) 1000 V(E.() = 1000 V(E. b)-50 V(E. c)= 20 F(a, b, d) T(F) 2000 V(F.a) = 50 V(F, b) 100 V( F. d)= 200 G(a, c. d T(G) 3000 V(G, a) = 50 V(G, c)=300 V(G. d) = 500 H (b, c, d) T(H) 4000 V(H, b) 40 V(He)=100 V(H. d)= 400. Give the dynamic programming table entries that evaluates all possible join orders allowing: a) Left-deep trees, and b) All trees. What is the best choice in each case