Simple recursion. Question at bottom of code.

o static void quickSortHelp(int * arr, int first, t last) aI/ [first astJ: range of valid indezes (not last1) if (first >.. 1ast) // no need to sort one or no elemen t ret urn; 16 #ifdef DEBUG 17 printf("firstu"u%d , ul astu"u%d ", first, last); s #endif 19 a int pivotarr [first]; int low first + 1; int highlast; hile (low pivot)) high-; if (low high) swap (& arr [low, &arr [high]) if (pivot> arr [high]) swap (& arr [first], &arr [high]); quickSortHelp (arr, first, high1) quickSortHelp (arr, low, last) If lines 42-45 are removed, this program is incorrect. If the original array is 1675 8765 5610 4072 9276 5632 1920 649 9073 4381 After running this incorrect implementation, what is the first element (index is zero) in the array