$1-$ For the following C$-$spaces draw the path that each of the following pathplanning algorithms take to avoid the obstacles in the shown maps:

I. Bug $0$

II$.$ Bug $1$

III. Bug $2$

$2-$ Compare between the algorithms with respect to shortest path $($if found$).$

$3.$Drow the direction to each one on the maps.