Rate monotonic scheduling is the optimal fixed$-$priority scheduling algorithm since for a given priority task sets $($with their deadlines equal to their periods$),$ if you can find a priority assignment for the tasks to make all tasks meet their deadlines, then assigning priorities to tasks according to rate monotonic scheduling scheme can always make all tasks meet their deadlines.

True

False