Implement a class for Task 1 and Hardcode algorithms for Linear Search, Middle Value, First Value, Last Value, Highest Value, Lowest Value, and Bubble Sort.

Main Function: Control of operation

Class will contain the methods below and an array as the data structure.

In your Class declare and fill the array with 1000 random integers read from .txt file generated in Task 1. Program operation should be the same.

Method 1:	Output all values
Method 2:	Output the sum of all values
Method 3:	Output all odd numbers
Method 4:	Output all even numbers
Method 5: New	Enter a search value / Implement Linear Search
Method 6: New	Output Middle Value (Values in the Middle) Not Average
Method 7: New	Output First Value in the Array
Method 8: New	Output Last Value in the Array
Method 9: New	Output the Highest Value and its location in the array. (Hardcode the algorithm.)
Method10: New	Output the Lowest Value and its location in the array. (Hardcode the algorithm.)
Method 11: New	Sort and then output values. Hardcode the bubble sort algorithm you will implement.