Johnson's algorithm is applied to the graph below.

$($a$)$ Give $h(1)=h(2)=h(3)=,h(4)=h(6)=h(7)=$

Give the modified weight of

$($b$)$ the shortest $2-$to$-3-$path