$1.$ Use an adjacent matrix or adjacent list graph representation methods input

a$)$ A man living in city L regularly visits his mother living at city K$.$ Each time he visits his

mother, he uses a different route to get from city L to city K$.$ The road network

connecting various cities is shown in Fig. $1.$ Implement an algorithm in Java which finds

ALL the possible routes to visit his mother from start to finish.

Fig. $1$: Map showing the road network connecting city L and K