Hello I was wondering for the code above, how you would implement medianOf3 to find the pivot value in this quick sort algoarithem

3 #de fine QUICKSORT H 5 #include 7 using std::Swap 9 note returns INDEX of median 10 ?emplate Inline 11 int medianor3 (T Ali. 1nt 1, 1nt r) 12 13 14 //this is overcommente also, try and avoid using pointers T* a-A + 1://array name is just pointer to 1st (0 index) elem., + 1 shifts 1*(T size) T* b-A+ l (r-1)/2://middle item... int division rounds down 16 17 18 19 20 21 //when a is a pointer, a is the dereference operator (gives value a points to) T* m: if(*a 34 int hoarePartition (T A, int 1, int r) 35 36 37 38 39 40 41 42 43 t elset /b