6. We have introduced the dynamic programming methodology in the lectures on two issues. The first one is the single source all destinations problem with general weights and the other is all pairs shortest paths problem. (a) (10%) Bellman-Ford algorithm applies dynamic programming methodology to solve the single source all destinations problem with general weights. Describe Bellman-Ford algorithm with time complexity analysis according to the graph representation. Please provide a solution to complexity reduction as well. (b) (10%) Give the algorithm solving all pairs shortest paths problem by dynamic programming methodology. Remember to include the basic idea in your answer. 7. Consider the following AOE network. e az = 3-6=8 a = 5 / V 29 = 2 W finish 12 13141516171819 10 start a = 4 = Do 5458871616 004229= 52 V as = 2 all; sa (a) (10%) Obtain e(i) and I(i) of activity i, for all i. (b) (3%) List all critical activities