Solve the problem please

Q5) Using Dikstra's find the shortest path for the following Graph, start with (6) dist(s) - 0 for all ve V-) 12 do dist[v] - S. 12 Q.V while QO dou mindistance, dist) 10 S. Suu) for all ve neighborstu) do if dist[v] > distuwiu, vi then dlv. 0u return dist Q5) Using Dikstra's find the shortest path for the following Graph, start with (6) dist(s) - 0 for all ve V-) 12 do dist[v] - S. 12 Q.V while QO dou mindistance, dist) 10 S. Suu) for all ve neighborstu) do if dist[v] > distuwiu, vi then dlv. 0u return dist