Write a Java class to perform the following:

1. Write a method to search the following array using a linear search, ( target elements: 11, 55, 17.). (count the number of comparisons needed). {06, 02, 04, 07, 11, 09, 50, 62, 43, 32, 13, 75, 01, 46, 88, 17}

2. Write a method to sort the array using Selection Sort. (count the number of comparisons needed)

3, Write a method to sort the array using Bubble Sort. (count the number of comparisons needed)

4, Search he sorted array using a binary search (recursive) for the same set of target elemens. (count the number of comparisons needed)