C++

Please read the question carefully and make sure that the intermedial steps for the proposition are also shown in the truth table.

Output for thruth table should print 'T' and 'F' not 0s and 1s.

NOTE: Do not hard code truth tables. The program must use binary or bitwase operators to compute the results.

Part A Write a program that produces the bitwise OR, bitwise AND, and bitwise XOR of the bit strings 1001 0011 1011 and 1111 1010 0000.

Part B Write a program that produces truth table for the following compound proposition and decide if it is a Tautology or Contradiction. 1. (p q) (p q) 2. (p <-> q) <-> r

Part C Write a program that produces truth table for the following compound proposition and decide if it is a Satisfiable or Unsatisfiable 1. ( p r ) ( q r ) (p q r ) 2. (p q) (p q)

Thank you in advance!