6. An algorithm has the following running time: T(n)=1+1/2+1/3+1/4+1/5++1 Assume that n=2k1 for some k>0 - If we group the terms (from left to right) using group sizes 1,2,4,8,16,32,.., how many groups will there be as a function of k and n (need the exact number of groups) [2pts] Show your work here: [3 pts]