Advanced level school computer science. need helps

The following algorithm is an implementation of a quick sort that operates on an array Scores. This algorithm assumes that the first element of an array is the zeroth element. This means that Scores [0] is the first element in the array. This pseudocode is available in the file QUICKSORT . TXT FUNCTION QuickSort (Scores) QuickSortHelper (Scores, 0, LENGTH(Scores) - 1) RETURN Scores ENDFUNCTION FUNCTION QuickSortHelper(Scores, First, Last) IF First Partition(Scores, First, Last) QuickSortHelper(Scores, First, SplitPoint - 1) QuickSortHelper (Scores, SplitPoint + 1, Last) ENDIF RETURN Scores ENDFUNCTION FUNCTION Partition(Scores, First, Last) Pivotvalue Scores [First] LeftMark First +1 RightMark Last Done FALSE WHILE (Done = FALSE) WHILE LeftMark LeftMark +1 ENDWHILE WHILE Scores[RightMark] >= PivotValue AND RightMark >= LeftMark RightMark RightMark - 1 ENDWHILE IF RightMark TRUE ELSE Temp Scores [LeftMark] Scores [LeftMark] Scores [RightMark] Scores [RightMark] Temp ENDIF ENDWHILE RETURN RightMark ENDEUNCTION Write program code to implement this algorithm. Ensure that you add the missing code to complete the algorithm. The area of missing code is highlighted as: Copy the sample data available in the SCORES. TXT file. Paste this into your programming code to set up the data to be sorted. Task 2.2 Add a function to your code to output Scores. Call this function before and after the operation of the quick sort so that the unsorted and sorted data is displayed