$4.$ How is partitioning important in the quick sort algorithm? $5$ Partitioning divides the unsorted input data list into smaller unsorted data lists Partitioning is the process of removing duplicates from an array Partitioning is the process of walking through an array Partitioning is the process of finding the splitting point of an array