Write a Java public static general method that doesn't belong to the Queue class(assuming the Queue type is Book and Book has a clone method, Book also has a method called getGenre() which returns the genre of the book):

Can you write a program in python for the dining philosopher problems that do not have deadlock? You have to use semaphores and use the strategy that a philosopher only picks the fork if both (left and right) are available. def philosopher(id: int, fork: list): The main is if __name__ == "__main__": semaphoreList = list() #this list will hold one semaphore per fork Philosophers = 5 for i in range(Philosophers): semaphoreList.append(multiprocessing.Semaphore(1)) philosopherList = list() for i in range(Philosophers): #instantiate all processes representing philosophers philosopherList.append(multiprocessing.Process(target=philosopher, args=(i, semaphoreList))) for j in range(Philosophers): #start all child processes philosopherList[j].start() for k in range(Philosophers): #join all child processes philosopherList[k].join() sample output: DEBUG: philosopher2 has chopstick2 DEBUG: philosopher2 has chopstick3 DEBUG: philosopher2 eating DEBUG: philosopher1 has chopstick1 DEBUG: philosopher0…

Given main() and an IntNode class, complete the IntList class (a linked list of IntNodes) by writing the insertInDescendingOrder() method to insert new IntNodes into the IntList in descending order. Ex. If the input is: 3 4 2 5 1 6 7 9 8 -1 the output is: 9 8 7 6 5 4 3 2 1   import java.util.Scanner; public class SortedList { public static void main (String[] args) {Scanner scnr = new Scanner(System.in);IntList intList = new IntList();IntNode curNode;int num; num = scnr.nextInt(); while (num != -1) {// Insert into linked list in descending order curNode = new IntNode(num);intList.insertInDescendingOrder(curNode);num = scnr.nextInt();}intList.printIntList();}}

Write a recursive instance method isSorted that takes a Link parameter and determines whether a linked list is sorted in descending order or not (return a boolean value).