Which of the following is a correct implementation of linear search on an array? public static int linearSearch(int array[], int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return arrayli); } else { return -1; } } } public static int linearSearch(int array[], int value) { for (int i = 0; i < array.length; i++) { if (arrayli) == value) { return i; } } return -1;

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity,…