a d 5 4 10 2 7 e 7 6 3 6 g h 5 4 2 4 5 i 4 5 1 6 5 6 3 k m 7 10 n 0 12 Graph B 2) [20 points] Apply Dijkstra's algorithm to Graph B with source m. Report the level function l and the parent function p. 3) [20 points] Find a max flow between m and d in Graph B (where edge weights are interpreted as capacities). Prove your answer is correct by finding a cut that has the same capacity as the value of the flow.