o se g ding-ding" , using the KMP algorithm. Write the failure function (an array of integers, of length equal to the pattern's b. For pivot value 7, provide any valid 3-part quicksort partitioning of array c, what might happen if you input a sorted (or reverse sorted) array into quicksort where the last element d. Draw a heap (as a tree) resulting from inserting the sequence 5,6,2,4, 10 into an initially empty heap. length). 3 marks) [-9, 13, 6, 3, 21, -2, 7, 7, 2) 3 marks) of a range to be sorted is selected as pivot? [2 marks 2 marks]