Part A) Problems and Proofs Rewrite the following claim as a universal proposition in symbolic form: "The algorithm bruteForceSearch() is a linear-time algorithm" and use the strategy of generalizing from generic particular to prove that the claim is correct. See the next page for a detailed explanation of the claim and related concepts in algorithm analysis. Part B) Proof by Cases Use the method of proof by cases to prove the following statement Vn e Z, n2-n +3 is odd