3-7 Bit manipulation. Minimizing instructions, write an instruction sequence that reverses the operation of the last problem. Note that the upper 4-bit "nibble" of the ASCII encoding of a digit is B'0011". 3-6 Bit manipulation. Assume that two bytes of a string variable are labeled D10 and 11 and that they contain the ASCII code for two digits. If the upper four bits of the ASCII code for a digit are forced to zero, what remains will be the binary value of the digit. Minimizing instructions, write an instruction sequence to form the "packed-BCD" version of this two-digit number into a 1-byte variable called D10_1. Leave the original string variable unchanged. For example, if D10=B'00110101' (i.e., ASCII code for 5) and D1 = B'00111001' (i.e., ASCII code for 9), then your code sequence should leave D10 and D1 unchanged while forming D10_1 = B'01011001' (i.e., the packed-BCD encoding of the decimal number 59). 3-7 Bit manipulation. Minimizing instructions, write an instruction sequence that reverses the operation of the last problem. Note that the upper 4-bit "nibble" of the ASCII encoding of a digit is B'0011". 3-6 Bit manipulation. Assume that two bytes of a string variable are labeled D10 and 11 and that they contain the ASCII code for two digits. If the upper four bits of the ASCII code for a digit are forced to zero, what remains will be the binary value of the digit. Minimizing instructions, write an instruction sequence to form the "packed-BCD" version of this two-digit number into a 1-byte variable called D10_1. Leave the original string variable unchanged. For example, if D10=B'00110101' (i.e., ASCII code for 5) and D1 = B'00111001' (i.e., ASCII code for 9), then your code sequence should leave D10 and D1 unchanged while forming D10_1 = B'01011001' (i.e., the packed-BCD encoding of the decimal number 59)