Consider the following complement algorithm. Algorithm complement(n): n Input: An integer n, where n > 0...

   

Transcribed Image Text:

Consider the following complement algorithm. Algorithm complement(n): 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 if n 10 then else return 10 - n return complement (n / 10) * 10 + ( 10 - n MOD 10 ) 1. Draw the recursion trace for the execution of method complement(n) using an input n = 93723 2. Show the final result. Consider the following complement algorithm. Algorithm complement(n): 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 if n 10 then else return 10 - n return complement (n / 10) * 10 + ( 10 - n MOD 10 ) 1. Draw the recursion trace for the execution of method complement(n) using an input n = 93723 2. Show the final result.