Given a shared$-$nothing system.$$a$.$ Describe the Planning$-$based Scheduling technique by explaining the tasks of its following four$$components: $($i$)$ scheduling window in query queue, $($ii$)$ operator server, $($iii$)$ scheduler, $($iv$)$ coordinator.$$b$.$ How intraquery parallelism and interquery parallelism are supported in this scheduling technique? $($You$$do not need to explain what are these two kinds of parallelism$).$c$.$ What is the advantage of this technique over the competition$-$based method?