Rewrite the following claim as a universal proposition in symbolic form: The algorthm bruteForceSearchis a liear-time algorithm" and use the strategy of generalizing from generic particular to prove that the claim is correct. For a detailed explanation of the claim and related concepts in algorithm analysis, see the figure on the next page. More Information on Part A The claim is about the running time of an algorithm described as a Java method in Figure1 The running time of an algorithm is measured by the number of primitive steps" required to complete the execution of the algorithm. For our purpose, let's count each program statement in the Java code as one primitive step. An algorithm is said to be a linear-time algorithm if its running time for any input is no greater than the number of elements in the input multiplied by some constant (a value that doesn't depend on the number of elements in the input) public int bruteForceSearch(int values, int value) int nunofsteps 0; boolean found- false; while( ! found kk num0fSteps