This assignment uses the past labs you have created. You have the option of either combining past labs into one larger lab, or using them individually to solve the listed problems.

1.) Decrypt the following: Lo cebo dy nbsxu iyeb Yfkvdsxo

2.) Convert 871 to base 7.

3.) Run '0111101' through your Hamming Receiver. If there's an error, state where it is, correct it, and output the original four-bit message that was being sent.

4.) Universal Set: [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]

Set A: [1,2,3,5,8,13]

Set B: [1,3,5,7,9,11,13,15,17,19]

Set C: [1,2,3,5,7,11,13,17,19]

Please print out: ((A Union B) Intersect C)

5.) Present a Truth Table for the following statement :

!(A XOR C) NAND (B OR A)

MUST BE IN C++