Everything is given. Please answer the entire thing with work to get a like.

1. Your old computer can only hold 10-bit integers using 2 's complement. 1. Convert decimal p=235 to 2 's comp. 2. Convert decimal q=81 to 2 's comp. 3. Convert 2 's comp in hex r=3FA to decimal. 4. Using 2's comp representation of p and p, perform q - p. Show all steps. 5. Repeat 4) to compute rp. Note: directly calculating -81 - (135) will earn _zero_credit. 2. Convert x=p(q+rs) into 1. a NAND-only circuit. 2. a NOR-only circuit. Draw the circuit. 3. A 2-bit encoder taking four input lines (a,b,c,d) has the following encoding scheme with respect to each activated incoming line: a only ->01, b only >11,c only >00,d only >10,a&d>01,b&c>11. All other incoming activations are "don't care" cases. 1. Build a truth table for this encoder. 2. What are the POS expressions for this encoder? 3. Draw the circuit using only inverters, AND, and OR gates