Question is rewriting the claim given as a universal proposition in symbolic form, which is given below in quotations

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.

More Information on Part A.

The claim is about the running time of an algorithm described as a Java method in Figure 1. 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, lets 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 doesnt depend on the number of elements in the input).

Below is the code given to answer the question above:

public int bruteForceSearch(int[] values, int value){

int numOfSteps = 0; boolean found = false; while( !found && numOfSteps < values.size){

numOfSteps++;

if(values[numOfSteps] == value) found = true;

}

return numOfSteps;