Consider the program below which preprocesses a vector. void triplesort(vector& v,int loint hi) { if (hi == lo) { i

[answerhappygod]

Consider The Program Below Which Preprocesses A Vector Void Triplesort Vector Int V Int Loint Hi If Hi Lo I 1 (97.95 KiB) Viewed 40 times

Consider the program below which preprocesses a vector. void triplesort(vector<int>& v,int loint hi) { if (hi == lo) { if (v[lo] > v[hi]) swap(v[lo],v[hi]); } else { triplesort the first 2/3 of v[lo..hi]; triplesort the second 2/3s of vlo..hi]; triplesort the first 2/3 of v[lo..hi]; 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.