How does the quicksort algorithm with divide and conquer handle the case where the pivot element is the largest or smallest element in the array?a$.$ The pivot element is swapped with the next$-$largest or next$-$smallest element.b$.$ The pivot element is ignored and the algorithm continues with the next element.c$.$ The algorithm terminates and returns the array as is$.$