In this project, you will write a theorem prove using Wang’s algorithm with GProlog. 1. We are now ready to work on your first theorem prover. For this, we are going to use Wang’s algorithm, which is described as follows: 2. Rules to determine the validity of a sequent: a. Write the premises down separated by commas, followed by an arrow and then the theorem to be proved. E. g.: p, ~q ^ r ⇒ p ^ ~q [~ denotes negation, ^ conjunction, v disjunction, ⇒ sequent, -> implication]