Consider the various strategies we discussed in the Broadcasting lecture.

1. [3 pts] Show that the Partitioning Strategy discussed in class terminates in O(log n) steps.

2. [3 pts] Consider the strategy where user i calls users 2i+ 1, 2i+ 2, 2i+ 3, 2i + 4, 2i + 5, 2i + 6. Write the transmission table for 30 users (not including Alice).

3. [4 pts] What is the max number of unreliable callers that does not affect the broadcasting algorithm and why?