(Solved) : 7 5 Points Indicate True False Following Statements Regarding Complexity Classes Sorting I Q37763613 . . . .

7. (5 Points) Indicate true or false for each of the following statements regarding complexity classes a) Sorting input arrays is a P problem. b) Max-Flow problem is a NP-complete problem. c) NP-Complete problems are harder than other NP problems. d) It has been proven that P-NP e) NP stands for Non-Polynomial. 8. (5 Points) For each of the algorithms listed in the table, indicate which of the following algorithm design techniques is used: Greedy algorithm, divide