Consider max 3-sat (given a set of 3-clauses, find the assignment that satisfies as many of them as possible). come up with a simple randomized algorithm that will achieve an approximation factor of 7 8 in expectation. that is, if the optimal solution satisfies k clauses, your algorithm should produce an assignment that satisfies at least 7 8 ∗ k clauses in expectation. you may assume that every clause contains exactly 3 distinct variables.

Write a program that defines symbolic names for several string literals (chars between quotes). * use each symbolic name in a variable definition. * use of symbolic to compose the assembly code instruction set can perform vara = (vara - varb) + (varc - vard); ensure that variable is in unsigned integer data type. * you should also further enhance your symbolic logic block to to perform expression by introducing addition substitution rule. vara = (vara+varb) - (varc+vard). required: debug the disassembly code and note down the address and memory information.