Consider the problem in which input is the same as 3-SAT, which is a boolean expression C1∧C2∧···∧Cn where each Ci is an "or" of three literals (each literal can be one of x1 , . . . , xm,¬x1 , . . . ,¬xm). Note that we assume a clause cannot contain duplicate literals (e. g., (x1 ∨ x1 ∨ x2 ) is not allowed). Instead of determining whether there’s a truth assignment on {xi } m i=1 that satisfies this boolean expression (which means it satisfies all the clauses), now we want to determine whether there’s an assignment that satisfies at least n − 1 clauses. Prove that Approx-3SAT is NP-Complete.

Annie is creating a corporate report for a company’s annual meeting. in the report, she wants to add the signature of various department heads. which device can annie use to capture signatures to include in the report? a. printer b. monitor c. e-reader d. digitizing tablet

Consider the following code snippet: #ifndef cashregister_h#define cashregister_hconst double max_balance = 6000000.0; class cashregister{public: cashregister(); cashregister(double new_balance); void set_balance(double new_balance); double get_balance() const; private: double balance[12]; }; double get_monthly_balance(cashregister bk, int month); #endifwhich of the following is correct? a)the header file is correct as given.b)the definition of max_balance should be removed since header files should not contain constants.c)the definition of cashregister should be removed since header files should not contain class definitions.d)the body of the get_monthly_balance function should be added to the header file.

My has been slow anyone else’s ?