Given the recurrence f(n) = 4 f(n/2) + 1, how many sub-problems will a divide-and-conquer algorithm divide the original problem into, and what will be the size of those sub-problems?