A number is called monotone if it consists of repeated decimal digits. For example, 3333 and 7777 are monotone numbers. (i) (ii) Write a divide and conquer function (in pseudocode) with time complexity (n) named multiply_monotone that takes as input a two mono- tone numbers. We assume n is maximum length (number of digits) of the two monotone numbers, and in turn, the length of each of them (for simplicity) may be taken to be a power of 2. You may assume a number is represented as a string of digits. code is O(n). Using Master Theorem, argue that the time complexity of your

A number is called monotone if it consists of repeated decimal digits. For example, 3333 and 7777 are monotone numbers. (i) (ii) Write a divide and conquer function (in pseudocode) with time complexity (n) named multiply_monotone that takes as input a two mono- tone numbers. We assume n is maximum length (number of digits) of the two monotone numbers, and in turn, the length of each of them (for simplicity) may be taken to be a power of 2. You may assume a number is represented as a string of digits. code is O(n). Using Master Theorem, argue that the time complexity of your