Model the above problem as a Shortest Path Netwrok model and find the shortest path from San Fernando V$.($node $3)$ to

Anaheim $($Node $8).$ Assume that arc directions are always from left to right and down to up$.$ E$.$g$.,$ Arcs $3-2,5-8,$ and $10-8$ are possible but arc $9-8$ is NOT.