All deadlocks entail competing demands for

Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into equal parts and requires each process to seek a portion upon starting. RM schedules real-time systems with CPU utilization below 1. When CPU utilization is less than 1, Earliest Deadline First (EDF) may schedule a real-time system. A process is initiated every p time unit. RM scheduling prioritizes shorter processes. EDF scheduling prioritizes processes with the shortest time frame.

Please help with this question!! Please provide explanations as well!

Develop a program C++ that accepts the name of a branch trace file as a command line argument.  Use the data to simulate 4 branch prediction algorithms: Fixed-False predictor "Static-First" predictor makes its first prediction false (predicting the branch will not be taken) Bimodal dynamic predictor begins in the state that will predict false but not confidently (assumes the previous prediction was an error) Two-layered dynamic predictor uses a 2-bit history to index its prediction table and sets the Prediction:ErrCount bits to 0:1, 1:1, 0:1, and 1:1 for the histories 00, 01, 10, and 11, respectively and an initial history of two branches not taken.   Your program (say it's a compiled C program) would be run like this: ./branch data.tra Trace File The trace file is line based where each line represents the history of a single branch instruction in memory.  Each line will be a long string of '@' or '.' characters (indicating the branch was taken or not, respectively) without…