can someone please show me step by step how to solve this discrete time markov chain problem?

thanks

Consider a delivery route as outlined in the gure below; ICE! 4 6 The intersections are numbered 1 through 6 and every line segment between two intersections denotes a road the delivery man must cover (e.g. 1->2, 2->5 etc.). In order to break the monotony of his daily routine, the delivery man does the following: every time he arrives at an intersection along a particular road, he takes one of the remaining roads available to him with equal probability (e.g. if he arrives at intersection 5 along 2->5 , he then takes either 5-)4 or 5->6 with probability U2). 1) Model the delivery man's choice of route as a DTMC, making sure to clearly define your states. 2) Compute the limiting distribution of the DTMC, according to your definition of the state in part a). 3) What fraction of the time does the delivery man take a road that has intersection 5 as one of its endpoints