Consider the single-server queue with geometrically distributed inter-arrival times and service times, with parameters ? and ? respectively, as discussed in class. Now assume that the system can store a maximum of 3 jobs (including the one in service). Draw the state transition diagram of the queueing system. Write down the balance equations of each state . Solve the steady-state probabilities .What is the probability that a new arrival will be rejected because the queue is full? What is the average number of jobs in the system? What is the average job delay in the system