Assume that the memory locations M[$20], M[$21] and M[$22]. Write a 68HC11 assembly language program (with lots of comments) that will determine the sum of the largest two numbers and store its value in M[$23].
Example: If memory locations contain the following:
M[$20] = $10
M[$21] = $FF
M[$22] = $20
Then your program should write the following in memory:
M[$23] = $30 ; the largest sum is M[$20] + M[$22] = $30
Your program should work for any numbers that are stored in M[$20], M[$21], and M[$23].