Recall the $($worst$-$case$)$ linear$-$time divide$-$and$-$conquer algorithm for finding the kth smallest of n reals, where we used groups of size $5.$ Suppose that we use the same algorithm but with groups of size g for some positive integer constant g$.$ Derive the recurrence relation for this algorithm as a function of n and g