4. (25 points) Consider the program below which preprocesses a vector. void triplesort(vector& vint loint hi) { LOV

[answerhappygod]

4 25 Points Consider The Program Below Which Preprocesses A Vector Void Triplesort Vector Int Vint Loint Hi Lov 1 (108.83 KiB) Viewed 38 times

4. (25 points) Consider the program below which preprocesses a vector. void triplesort(vector<int>& vint loint hi) { LOV Bensif (hi == lo) { if (v[lo] > v[hi]) swap(vllo),v[hi]); } ) ] else { triplesort the first 2/3s of vlo..hi]; triplesort the second 2/3s of vſlo..hi]; I denne triplesort the first 2/3s of v[lo..hi); To return; } } . a. Define a recurrence relation WITH BOUNDARY CONDITIONS as a function of the vector length which satisfies the time complexity of the program. b. Solve the recurrence relation. Barthoş korisne od brots og bogatonestepad