Assessment: each mistake:-0.25 points TASK 2 (8 points) 21. (7 points). Use Dijkstra's algorithm (write down all steps in each iteration) to find the lengths of the shortest paths between the vertex b and all other vertices in the given graph. 22. (1 point). Use backtrack procedure to find the sequence of vertices in the shortest path from the vertex b to the vertex h in the given graph. Guideline: If the result of some iteration is incorrect, all following iterations will not be assessed (no points will be given). Page 1 of 3