Given a boolean formula as follows.

The above formula can be stated as: Satisfiable: If the variable can be assigned a value (T/F) in such a way that the result of the formula TRUE Unsatisfiable: If the variable is given a value (T/F) the result of the formula is FALSE

a) Change the formula to a directed graph and determine whether it is satisfiable or unsatisfiable using strongly connected component (SCC) search! (If there is a variable and its complement, for example: a and a', in one SCC it can be concluded that the formula is unsatisfiable)

b) Write pseudocode to solve the above problem.

c) Explain the time complexity analysis of the pseudocode.

F = (a vb) A (a' v b') ^ (c vb') A (a' vb) =