Consider the following algorithm: int f(n) In is a positive integer and n is a power of two */ if (n==1) return n int sum =n int m=n for i=1 to log2n do \{ m=m/2 sum = sum +f(m) \} return sum Trace execution of f(8) by drawing the recursion tree. Show all function calls (callers and called functions), and intermediate results; and show what f(8) returns. You can work on a paper and submit an image of it