Is there a path from $\text{'}$A$\text{'}$ to $\text{'}$L$\text{'}?$ Use the find$\_$path function to find out. If there is a path, what is it$?2\mathrm{.}3$ Question $3$: Coding Problem

Consider the following Python implementation of a simple graph:

$```$

graph $=\{$

$\text{'}$A$\text{'}$: $[\text{'}$B$\text{'},\text{'}$C$\text{'}],$

$\text{'}$B$\text{'}$: $[\text{'}$D$\text{'},\text{'}$E$\text{'}],$

$\text{'}$C$\text{'}$: $[\text{'}$F$\text{'},\text{'}$G$\text{'}],$

$\text{'}$D$\text{'}$: $[\text{'}$H$\text{'}],$

$\text{'}$E$\text{'}$: $[\text{'}$I$\text{'},\text{'}$J$\text{'}],$

$\text{'}$F$\text{'}$: $[],$

$\text{'}$G$\text{'}$: $[\text{'}$K$\text{'}],$

$\text{'}$H$\text{'}$: $[],$

$\text{'}$I$\text{'}$: $[\text{'}$L$\text{'}],$

$\text{'}$J$\text{'}$: $[],$

$\text{'}$K$\text{'}$: $[\text{'}$M$\text{'},\text{'}$N$\text{'}],$

$\text{'}$L$\text{'}$: $[],$

$\text{'}$M$\text{'}$: $[\text{'}$O$\text{'}],$

$\text{'}$N$\text{'}$: $[],$

$\text{'}0\text{'}$: $[]$

$\}$

def find$\_$path$($graph$,$ start, end, path$=[])$:

$``````$

path $=$ path $+[$start$]$

if start $==$ end:

return path

if start not in graph:

return None

for node in graph$[$start$]$:

if node not in path:

new$\_$path $=$ find$\_$path$($graph$,$ node, end, path$)$

if new$\_$path:

return new$\_$path

return None

$*$ Example usage:

# print$($find$\_$path$($graph$,\text{'}$A$\text{'},\text{'}$O$\text{'}))$

$```$