Help construct truth table

Consider the following 7 clauses . GAV B) . (AVC) . BVC) . (BVA) . CVA) (a) Fill out the truth table and see if you have an assignment of variables that satisfies ALL 7 clauses. (b) The GSAT algorithm for finding a model to satisfy a set of clauses uses hill-climbing search. It starts by choosing a random assignment of truth values to all the variables. At each iteration, one variable assignment is made which increases the number of sat- isfied clauses, i.e., the number of clauses which are true. The algorithm stops when no assignment increases the number of satisfied clauses. Use GSAT to find a global maxi- mum, i.e., an assignment that satisfies all clauses. Use the following initial assignment: As T(rue), B = False), and C = F