Consider an open Jackson network of two queueing stations, with one server at station and two servers at station Assume that jobs arrive to stations and according to independent Poisson processes with rates and per hour, respectively. All jobs departing from station will move to station and of jobs departing from station will go to station the remaining of jobs departing from station will leave the system Assume furthermore that the service times at each station are independent and exponentially distributed with hourly rate Specify the following quantities: a Steadystate probability that station is empty b Steadystate probability that the entire network is empty c Longrun average number of jobs within the network d Longrun average time in the system per job