let be an array of size > containing integers from to inclusivewith exactly one repeated describe fast algorithm for finding the integer in that is repeated - let be an array of size > containing integers from to inclusivewith exactly five repeated describe good algorithm for finding the five integers in that are repeated - suppose you are designing multi-player game that has > playersnumbered to ninteracting in an enchanted forest the winner of this game is the first player who can meet all the other players at least once (ties are allowedassuming that there is method meet( , )which is called each time player meets player (with )describe way to keep track of the pairs of meeting players and who is the winner - give recursive algorithm to compute the product of two positive integersm and nusing only addition and subtraction - describe fast recursive algorithm for reversing singly linked list lso that the ordering of the nodes becomes opposite of what it was beforea list has only one positionthen we are donethe list is already reversed otherwiseremove - describe good algorithm for concatenating two singly linked lists and mwith header sentinelsinto single list that contains all the nodes of followed by all the nodes of - give fast algorithm for concatenating two doubly linked lists and mwith header and trailer sentinel nodesinto single list - describe in detail how to swap two nodes and in singly linked list given references only to and repeat this exercise for the case when is doubly linked list which algorithm takes more time