2. (3 pts) A computer server receives a job at each discrete time slot with probability '11. If the server has 5 jobs already, the job is declined. Otherwise, it joins the heap. In the same time slot, if the heap has jobs, exactly one is completed With probability %. We would like to understand how the # of jobs in the heap behaves. Model this as a Markov chain: identify the states, calculate the transition probabilities, and draw the corresponding graph with states and arrows labeled correctly