Question No. 1 (10+15 =25 marks)
Q1: (Part a): Is the following Boolean formula satisfiable?
(Part b): Show that NP is closed under concatenation.
Question No. 2 (12+13 =25 marks)
Read the research paper entitled “Computing the maximum violation of a Bell inequality is an NP-problem” and answer the following questions:
1) How can maximize the bell inequality as discussed in the paper?
2) How can you analyzed the bell inequality is NP problem of Turing machine?