Take-a-Ticket State Machine: Draw a state machine for take-a-ticket. Describe the state machine using pseudocode, with a state machine for each sender and each receiver. Extend the state machine to...

Take-a-Ticket State Machine: Draw a state machine for take-a-ticket. Describe the state machine using pseudocode, with a state machine for each sender and each receiver. Extend the state machine to handle hunt groups. Worst-Case Storage for Set-Pruning Tries: Generalize the example of Figure 12.6 to K fields to show that storage in set-pruning-trie approaches can be as bad as O(Nk /k).