Basic analysis. Start by computing expected time in system and capacity $($throughput$)$ of the overall system using the following steps. You$$ll want to know how high you can make arrival rates and still maintain system stability. In a stable system, the overall arrival rate is also the rate out, so throughput is just the arrival rate. We$$ll start by trying an arrival rate of $180$ voters per hour.

$1.$ In a blank spreadsheet $($not q$.$xls$)$ set up a table with one row for each station and the numbers in the table above. Add columns for $,\backslash$lambda $,$ s$*,$ and W$.$ Be sure all the columns in your spreadsheet are well labeled, including units. Fill in the columns for $,$ and s$*.$

$2.$ Fill in the $\backslash$lambda values as done in the first Jackson Queue example in lecture. Using the Jackson queue assumptions, and q$.$xls$,$ compute the expected time at each station $($W$).$ Notice that the majority of stations are NOT M$/$M$/1$ stations, so you must use q$.$xls rather than the formulas given in class. For any single server stations, you may use formulas from lecture. If any of your values come out to be negative, remember that this means that they are undefined $($positive infinity$),$ and the system is unstable.

$3.$ If your original system is unstable, you are allowed to add capacity $($one more voter processed simultaneously$)$ at one station. If you look carefully at the information you have, you will be able to pinpoint the most effective station to increase the capacity of$.$ Barring that, simply experiment by trying additional capacity at various stations.