Qucstion $1$: See below atached undirected consected network and use Dijkstra algorithen to find shortest path from $0$ to $5.$ You will need to use computer to find the solutice. Report your input and cutput.

Qucstion $2$: For the connected network in Question $1,$ use Prim algorithm to solve the minimum spanning trec. You will necd to use computer to find the solution. Report your input and output.