Create Truth Table of a dynamic size using Bitwise Operations

This assignment expects you to create a truth table combination of dynamic size that is input by the user. Submit your assignment in a single code file named printTruthTable.c

What is a truth table combination?

A truth table of size n is all the possible T/F (1/0) combinations for a set of that size.

For example, the total possible T/F values for a set of

size 1 is 2 { T, F}21

size 2 is 4 { FF, FT, TF, TT}22

size 3 is 8 { FFF, FFT, FTF, TFF, FTT, TTF, TFT, FFF}23

Ask user for size of input of the truth table n (1 ?

n ?

5) to be constructed.

Calculate the total number of combinations for size n.

For a set of size n, there would be 2n

combinations. Do not use power function to calculate this result.

Construct the truth table of size n.Present each combination in a separate line. Use at most 2 nested loops no matter the size of n.

Hint: Slide 18 / ch20.ppt

Steps:

Restrictions:

1. Can only use at most 2 nested loops to generate the truth table.

2. Use Bitwise Operations to access and set the bit to generate all the truth table combinations for size n input

Hints:

1. Produces the output expected for this assignment but does not use the bitwise operators.

Sample Output: