The function superpower receives two inputs, x and n, and should return xn-2 . x is a real number and n is a positive integer. superpower (x, n) if n = 1, then return (x^2) y : = superpower (x, n-1) return( ? ) the correctness of algorithm super power (x, n) is proven by induction on n. what would be proven in the base case?

a. super power (1, n) returns 1

b. super power (0, n) returns 0

c. super power (x, 0) returns x-2

d. superpower (x, 1) returns x2

Write a new lc-3 trap subroutine (i. e. a subroutine that will be invoked via the trap instruction) that will receive a numeric digit entered at the keyboard (i. e. an ascii character), echo it to the screen, and return in r0 the corresponding numeric value: so if the user types the digit '7', the character '7' will appear on the screen, but the value returned in r0 will be b0000 0000 0000 0111 (#7) you may not use any trap calls in your code - you must implement the "polling" code that interrogates the keyboard status and data registers. ; getnum_tsr ; a subroutine for obtaining a numeric value ; given ascii numeric digit input to keyboard. ; the numeric digit is echoed to the console (e. g. '7' = b0000 0000 0011 0111), ; but the value returned in r0 is the actual numeric value ; corresponding to the digit (e. g. b0000 0000 0000 0111 =