(Solved): Consider a variant of Median-of-Five algorithm in which, instead of partitioning input into \( n / ...

Consider a variant of Median-of-Five algorithm in which, instead of partitioning input into \( n / 5 \) blocks of size 5 , we partition the input into \( n / 3 \) blocks of size 3 . a) Follow the same steps as slides 63 and 64 of the Sorting module to derive a recursive formula for the time complexity \( T(n) \) of this algorithm. b) Try to solve the recursion by guessing that \( T(n) \in O(n) \). Follow the same steps as in the slides to indicate whether we can state \( T(n) \in O(n) \) or not.