A. Draw the recursion trace for the execution of method complement( n ) using an input n = 93723 (5 points) B. Show the final result. (1 point) Algorithm complement( n ): Input: An integer n, where n > 0 and no digit of n is 0 Output: The complement of the number formed by replacing each decimal digit of n by 10 n if n < 10 then return 10 n else return complement ( n / 10 ) * 10 + ( 10 n MOD 10 )