The following program compares two ASCII character strings of the same length. One string starts in memory location x5000, the other starts in memory location x6000. The characters are stored in a sequential series of memory addresses, and the last such address contains an ASCII NUL x00 (used as sentinel). If the strings are the same, the program terminates with the value +1 in R0, otherwise the program ends with the value -1 in RO a. Insert the missing instructions in the code below You do not need to submit the program, only the missing instructions, referring to their respective number .ORIG x4000 Insert instruction ai here LD LD LDR LDR BRz R1, STRING1 R2, STRING2 R3, R1, #0 R4 , R2, #0 EQUAL NEXTCHAR 10 12 Insert instruction a. ii) here 13 14 15 Insert instruction a. iii) here NOT ADD ADD BRz ADD 16 R3, R3 R3, R3, #1 R4, R4, R3 NEXTCHAR RO, RO, #-1 19 Insert instruction a. iv) here EQUAL STOP STRING1 STRING2 ADD R0, R0, #1 HALT FILL x5000 FILLx600 . END
b. Write a symbol table for the code above. Your symbol table should be similar in nature to that produced by the LC-3 assembler: for each label that appears in the code, your table should list the label and associate the label with an address in LC-3 memory. For an example, see P&P Section 7.3.3, pp. 186-187