Problem 6 Es.) Use the BellmanFord algorithm to nd the solution to nd the shortest path distance from a to t in the prohlem in Figure 1. Please show the progress of your algorithmI level by level. A preferred method for this would be to show the distance labels at each level, using a table. (b) Show how one can adapt the BellmanFord method so that it produces the shortest path from a to t, and illustrate your method on the problem in Figure 1. {You may wish to do this illustration in conjunction with part (a).) Figure 1: Directed network for Prohlem