exam help please ??

1. Consider the vertex matrix M that represents the route map of a new rapid train that services the five cities, P, P, P, P, and P. The entry m. =1 indicates that there is a service between city i and city j; otherwise m, =0. 01010 0 01 10 1 10 0 0 1 10 01 0 0 010 Draw a directed graph D to visualize the routes of the train service. ( b ) How many possible routes, consisting of 3-step connections or less, are there from P. to P, ? (c) List down the various connections obtained in (c)