1. create a Stock class containing two data fields: stockName (a string), and stockPrice (a double). Then write the appropriate accessor and mutator methods, as well as the toString, equals, and greaterThan methods. The equals methods returns true if two Stock objects have the same name and price, otherwise false. The greaterThan method takes a Stock object as argument and returns true if the calling object's price is greater than the argument object's stock price, otherwise false.

2. Demonstrate the Stock class in a program to:

create an array of 20 elements. Each element is a Stock object

sort the array in ascending order based on the stock price using any sorting algorithm. You need to rewrite the sorting algorithm to make it work on object sorting.

ask the user to enter a stock name and price.

search the array (using sequential search or binary search) for that stock

3. Analyze the worst-case time complexity for sorting an array of Stock objects and searching a stock in the array. Suppose the problem size (the array size is n).

Thank you!