Design and implement a program (name it linear binary search) to implement and test the linear and binary search algorithm discussed in the lecture slides. define method linear search() to implement linear search of an array of integers. modify the algorithm implementation to count number of comparisons it takes to find a target value (if exist) in the array. define method binarysearch() to implement binary search of an array of integers. modify the algorithm implementation to count number of comparisons it takes to find a target value (if exist) in the array. now, develop a test method to read integer values from the user in to an array and then call methods linearsearch() and binarysearch() and printout the number of comparison took to find the target values using each search method. document your code and organized your outputs as follows: arrays values: target value: linear search comparisons: binary search comparisons: