Modify the algorithm for Knapsack described in class to return the set of objects with the maximum profits. E.g., for the example input on slides, your algorithm should return {3,4}.

betterAddProduct Write a method in your Warehouse class to further optimize addProduct. As of now, it’s possible that an item is removed from a full sector to make room for a new product, even if there are other sectors which are not full. If the current sector is not full, add the product as normal. Otherwise perform a linear probing-like operation to try to find a non-full sector (if the current one is full). Keep incrementing the sector until you either find one with space, or you return to your original sector. If you get to Sector 9, wrap around to Sector 0. If you found a new sector with space, add the product into this sector. In a real-world scenario we would have to make sure to change the ID in our system and make sure it doesn’t conflict with an existing one. In this assignment that is not necessary since the output only contains the name. If you returned to the original sector, perform eviction and add the product as normal.

Question 2, please. Returns a pair consisting of the max value in the AD, and of the set of keys that attain that value.

Please explain the answer of getting the exact running time of the program. The attached photo's answer is already correct only the explanation of getting the exact running time is needed.

Implement the Solver class. In doing so, you are allowed to define other classes to help you (as well as use “built-in” Java classes or the book’s classes). The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of booleans and returns a char array containing a minimal sequence of moves that will lead to the solved board (all the cells around the edges being filled). The board configuration is passed in as a 5-by-5 boolean array of Booleans with exactly 16 true cells (filled) and 9 false cells (empty). The solve method then returns an array of characters representing a minimal sequence of moves that solves the puzzle. In other words, if the characters from the returned array are used in order as input to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions…

Can someone translate this into java, please?    Student Course::FindStudentHighestGpa(){      int totalStudent = roster.size();    double maxGpa = 0;      // Iterate through every student and find the maximum GPA    for(int i = 0;i < totalStudent;i++)    {        if(roster[i].GetGPA() >= maxGpa)            maxGpa = roster[i].GetGPA();    }      // return student having maximum GPA    for(int i = 0;i < totalStudent;i++)    {        if(roster[i].GetGPA() == maxGpa)        return roster[i];    }}

In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume

Can you help me with this question?

write a program using java Write the class Student having attributes Id (int), name (String), age (int) and cgpa (double) and methods to set the values of attributes and to return them.Write another class name Student Management having array of students and count of students as attribute. There should be method for the following:1. Add new Student in Array2. Remove a Student from Array using Id (of Student)3. Sort the Students in array using Id (ascending order)4. Sort the Students in array using Age (ascending order)5. Sort the Students in array using CGPA (ascending order)6. Reverse the order of the Students in array7. Display information of all Students in array (from zero index to last index)Write another class named as Main having main method and show activity of above methods.1. Add 5 Students in array2. Display all students in array3. Remove a student by name [Hint: Use equals method to check equality e.g. str1.equals(str2) ]4. Display all student in array5. Sort array by Id and…

Write a deletion method for the AVLTree class that utilizes lazy deletion.There are several techniques you can use, but a simple one is to simplyadd a Boolean field to the Node class that signifies whether or not the nodeis marked for deletion. Your other methods must then take this field intoaccount.