Write a python function that takes as input the forward star representation of a network and a starting node s, and finds the shortest path to all nodes using Dijkstras algorithm. The program should output the pred vector as well as the shortest path lengths (the vector d). For the sake of illustration, demonstrate your code by solving the shortest path instance given in the Figure.

6 2 4 4 7 0 6 5 2 8 6 2 4 4 7 0 6 5 2 8