use an adjacent matrix or adjacent list graph representation methods as input for question b

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

b$)$ He discovers that a new city M has been built with a road network connecting it to

other cities as shown in Fig. $2.$ He wants to find out if a path to visit his mother exists

through this new city. Use your implementation from Question $1$a to find out whether a

path exists from start to finish through city M$.$