Explain how to do Dogleg left $-$Edge algorithm in visi design Dogleg Left$-$Edge Algorithm

Given a channel with the following pin connections $($ordered left to right$).$

$($a$)$ Draw the vertical constraint graph $($VCG$)$ without splitting the nets.

$($b$)$ Determine the zone representation for nets $A-E.$ Find $S(col)$ for columns $a-h.$

$($c$)$ Draw the vertical constraint graph $($VCG$)$ with net splitting.

$($d$)$ Find the minimum number of required tracks with net splitting and without net splitting.

$($e$)$ Use the Dogleg left$-$edge algorithm to route this channel. For each track, state which nets are assigned. Draw the final routed channel.