small project array in java

Q1) Write an array class that implements the search and sort methods discussed in the classroom. Then write a program to test your class. 1. Create an int Array of Size 100,000 (main method) 2. Generate random values between 1 and 10000 and store them in the array. (main) 3. Implement the sort method discussed in class and use it to sort the array. (array class) 5. Implement search methods discussed in class (linear search and binary search). (array class) 6. Pick any key from the list (for example: 423). Then search for that key and print the index using both searching techniques, starting with the Linear, then the Binary Search. Notice: which search will be executed in less time, does the Sort method affect the speed of the binary search? What if the array was sorted at the beginning, then you call the binary search, which is faster? Q2) Write a program that represent a class and stores student names and student grades out of 100. The program should ask the users to enter the names and the grades. Then it will show the name of the student with highest grade and the number of students with grades above than the average. Note: DON’T use the Arrays class, Submit the .java files only (2 files for Q1, 1 file for Q2)