(1) (20 pts. Consider a boolean function f = (a eb) | a. (a) (pt) Get rid of and in f. Simplify the result. (b) (pt) Construct the truth table for f. (C) (4pt) Write f in a disjunctive normal form. (d) (4pt) Is f satisfiable? a b aebaebla FF FT TIF TT TABLE 1. Write the f-values in the last column. You are not required to fill in the other 2 columns