Need help on these foundational computer science questions. Please note that some exercises are displayed twice in the attached images for purposes of showing context.

Exercises 1. What is bus arbitration? 2. Suppose that a device wants to gain control of the bus, and the grant line coming into that device is asserted. However, we know that in some schemes, the bus may be busy when the grant line is asserted. For the following schemes, how does the device know that it can gain control of the bus? (a) Daisy chaining with an arbiter (b) Daisy chaining with an arbiter and priority levels (c) Daisy chaining with hidden arbitration (d) Decentralized daisy chaining 3. (a) What is starvation? Suppose there is a system with 5 devices which uses a daisy chain with an arbiter for bus arbitration. (b) Which of those devices could suffer from starvation? Explain your answer 4. What are the advantages of hidden arbitration? What are its costs