(a) Change the following bit patterns to hexadecimal notation. 100011110000 11111111

(b) The processes (A, B, and C) are running concurrently. Process A has acquired File1. Process B has acquired File2, but needs File1. Process C has acquired File3, but needs File2. Draw a diagram for these processes. Is this a deadlock situation? If your answer is “no”, show how the processes can eventually finish their tasks.