Answer the following statements true (T) or false (F)

1) Static table-driven scheduling is applicable to tasks that are periodic.
2) One of the more promising methods of resolving multitask scheduling conflicts for periodic tasks is rate monotonic scheduling.
3) Real-time tasks are not handled any differently than non-real-time tasks in the priority queues.
4) Linux provided a real-time scheduling capability coupled with a scheduler for non-real-time processes that made use of the traditional UNIX scheduling algorit hm.
5) In the real-time-priority class, all threads have a fixed priority that never changes andall the active threads at a given priority level are in a round-robin queue.

1) T
2) T
3) F
4) T
5) T