Problem $2$: $(10$ pts$.)$ Consider the grid system shown below, that represents the channels of a layout.

The thin grid lines represent unit distances; the heavy lines represent the channels. Using a Lee type

routing algorithm, find a minimal length path between any corners of the two red cells. Label the

graph so we can follow your computations.