Consider the following two Boolean Formulas f_1: x_1 Lambda (~ x_1 x_2) Lambda (~x_2 x_3) Lambda Lambda (~ x_99 x_100) f_2: x_1 Lambda (~ x_1 x_2) Lambda (~x_2 x_3) Lambda lambda (~ x_99 x_100) (a) If you were to write a truth table for f_1, (DO NOT ACTUALLY DO THIS!) how many rows would it have? Why? (b) If you were to write a truth table for f_1, how many rows evaluate to True? Why? (c) If you were to write a truth table for f_2, how many rows evaluate to True? Why