can someone please show me step by step how to solve this jackson network queueing problem?

thanks

Cansider the following network, shown: This is a Jackson network where services are exponential with rates u1,u2,p3,p.4, and [1.5 at nodes l,2,3,4, and 5 respectively. Each node has one server and innite queue capacity. There are two types of external arrival processes to the system and they are both Poisson with rates 1A and 1.3 respectively. Jobs exiting server 1 are routed to server 2 with probability p and to server 3 with probability 1 p. Jobs exiting server 4 either depart the system with probability 1 q or are re-routed back to server I through server 5 with probability q. [Find the maximum 11!. and 1.3 that the network can tolerate without any queue blowing up. *for the rest of the problem, assume we operate the network at a loading that ensures no queue blow up: 2) Find the expected delay of a job in the network. 3) Assume that a type B job departs the network after being serviced by node 4 for the rst time. 1What is the expected delay for such a job? 4) What is the expected number of times that ajob has to pass through server 5 before leaving the system? 5) Find the routing probability that minimizes the expected delay of ajob in the network. (Give an equation involving p, q, 1A, 13, 111, 142, pg, p4, [15. There is no need to solve this equation) {5) For 1.12 = pg, do you expect p to be more, less, or equal to NE? Explain your