In Matlab, apply Dijkstra$$s algorithm to the given figure to find the shortest distance from a starting point $(0)$ to all other vertices. Develop a MATLAB$$ code that outputs the shortest $($least$)$ distance from $0$ to $0,0$ to $1,0$ to $2..\mathrm{.}0$ to $8.$