g Let X be a problem that is in the class NP . For each of the following write if it is " True," "False," or "We don’t know." Justify your answer. (a) Solutions to X can be verified with a polynomial - time algorithm. (b) There is no polynomial - time algorithm for X . (c) If there exists a polynomial - time algorithm for X , then P = NP . (d) If there exists a polynomial - time algorithm for X , then there m ust exist a polynomial - time algorithm for the Traveling Salesman Problem. (e) If there exists a polynomial - time algorithm for the Traveling Salesman Problem, then there must exist a polynomial - time algorithm for X .

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 =