Questionfi: [25 marks] a) Give 3 examples of NP-completeproblems. -Explain how to reduce the satisfiability decision problem with k clauses, to k - clique a polynomial time? satisfiable the following instance of a satisfiability problem, to decide whether it is a,b,c, and d, are Boolean variables: d) (bvdvc) b) Explain an algorithm to solve the 01K napsack problem using a branch and bound algorithm and a priority queue. Apply the method for the three following items: with sizes 2,4, and 5, corresponding respectively to values 6,7 , and 8 . The knapsack [15 marks] [10