Validate the below two statements $($True$/$False$)$ with brief justification $($use bullet$-$points$)$:

a$)$ "The upper bound on achievable utilization falls as the number of independent tasks in the system being developed increases when RMA is used for scheduling a set of hard real$-$time periodic tasks.

b$)$ "Table$-$driven schedulers do require storing a precomputed schedule like cycle$-$driven schedulers." $[4$