Let phi be a boolean formula constructed from the boolean input variables x_1, x_2, ..., x_k, negations (not), ANDs (Lambda), ORs (), and parentheses. The formula phi is a tautology if it evaluates to 1 for every assignment of 1 and 0 to the input variables. Define TAUTOLOGY as the language of boolean formulas that are tautologies. Show that TAUTOLOGY elementof co-NP. Let phi be a boolean formula constructed from the boolean input variables x_1, x_2, ..., x_k, negations (not), ANDs (Lambda), ORs (), and parentheses. The formula phi is a tautology if it evaluates to 1 for every assignment of 1 and 0 to the input variables. Define TAUTOLOGY as the language of boolean formulas that are tautologies. Show that TAUTOLOGY elementof co-NP