this is algorithm question

Design algorithm to accept as input the following recurrence function forms

• Divide-and-Conquer: T(n) = aT(n/b) + f(n), where constants a is an integer such that a 1 b > 1, and b is a rational number Note you are not being asked to accept T(n) = aT(n/b) + gT(n/h) + f(n) recurrence relations
• Chip-and-Be-Conquered: T(n) = aT(n b) + f(n), where constants a is an integer such that a 1 b > 0, and b is an integer Your algorithm that must accept the following f (n) forms: polynomial - cnd where 0 < c < , and c is a rational number 0 < d < , and d is a rational number Example: (1/2)n(2/3)

• In other words, how to print out the results of a recursion tree on the console (4 depths) as String format.
• to pass into a method recursionTree an integer a, rational # b, rational # c, rational # d, and a Boolean value true for deciding between identifying whether the T(n) is a divide or chip by checking if a is an integer >=1 and b>1 it will be a divide, and chip will be used if a>1, and b is an integer.

steps

first started with for (int i=0; i<=3; i++) for each depth of recursion tree and then would decide whether T(n) is divide & conquer or chip by checking above conditions using if-else statement

Then, println the total cost/work done at each depth 0, 1, 2, 3 and also print each ith line 0, 1, 2, 3.