Read carefully task statement. A work with vertices that don't match the statements will not be graded. Tasks: 1. Apply Dijkstra's algorithm to the given graph to find the length of the shortest path from vertex h to all other vertices. 2. Use the backtracking procedure to find vertices in the shortest path from h to a. 3 5 a b 2. 2 7 3 4 d e LO 8 2 2 9 3 2 f 09 h Important notes: - Students have to solve tasks by a hand and show all iterations and steps. - Students have to create a report as pdf or doc file which contains the photos of their handwritten work in the order representing the order of the solution. Only one file could be attached