The runtime of a divide-and-conquer algorithm is described by the following recurrence: T(n) = 4T(n/2) + O(1). How many subproblems will we have at the 6th level of recursion if the top level is considered to be the 0th level________?
what does mean by branching factor in this????