IN JAVA

1. create a Stock class containing two data fields: stockName (a string), and stockPrice (a double). and implementing the Comparable interface (check Java API). Write the appropriate accessor and mutator methods, as well as the toString, equals, and compareTo methods. The equals methods returns true if two Stock objects have the same name and price, otherwise false. The compareTo method takes a Stock object as argument and returns an positive integer if the calling object's price is greater than the argument object's stock price, O if the two stocks have the same price, otherwise a negative integer. 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). Requirements: 1. program should be well-documented 2. time efficiency analysis should be typed in a .txt or .docx file. Upload the file 3. Submit the repl.it link of the program