Suppose you have a simple hashing system for storing integers that just uses a compression function to determine the array slot to use and uses linear probing for collision resolution. collision(s) occur if the size of the array is 20 and the following sequence of integers is added: 5 10 15 20 25
Each time the chosen array slot is already occupied should be counted as a collision; in other words, multiple collisions can occur when adding a single element due to collisions happening while linear probing. Your answer should be a number.

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 =