Many parallel algorithms require a broadcast step in which one task communicates a value it holds to all of the other tasks.

a$.$ Using the task$/$channel model described in this chapter, devise an efficient parallel algorithm implementing broadcast.

b$.$ Prove that the algorithm you devised in part $($a$)$ has optimal time complexity.