On another day, Ted is able to fix his car, and so all four delivery drivers are available. However, only three orders come in$,$ one from each of $N,E,$ and $S.$ Based on past deliveries, management creates a $($non$-$uniform$)$ random assignment system that takes into account that some individuals are potentially better at delivering to certain areas. The system maintains these probabilities to draw final assignments. However, the system is new and management is not sure it is properly working. For the three incoming orders, the random assignment input is

$\backslash$table$[[,N,E,S$