How would I implement the given function? Based on the given prompt? 3456789LO11L2L314L5L6L7L819202122232424252627282930public class Main{static int maxHeads (int[] birds, int m) {?}}Run | Debugpublic static void main(String[] args) {int arr1[] = {20, 1, 15);int arr2[] = {2, 1, 7, 4, 2);int arr3[] = {4, 10, 6, 7, 3, 1);ROBLEMS 2return 0;✓ TERMINALSystem.out.println("Test 1, Total Heads 20 = " + maxHeads (arr1, m: 1)); //m = 1, bird 1 cut 20 heads, arr1 is now {10,1,15}System.out.println("Test 2, Total Heads 35 = " + maxHeads (arr1, m: 2)); //m = 2, bird 3 cut 15 head, arr1 is now (10,1,7}System.out.println("Test 3, Total Heads 45 = " + maxHeads (arr1, m: 3)); //m = 3, bird 1 cut 10 heads, arr1 is now (5,1, 7}System.out.println("Test 4, Total Heads 7 = " + maxHeads (arr2, m: 1)); //m = 1System.out.println("Test 5, Total Heads 11 = " + maxHeads (arr2, m: 2)); //m = 2System.out.println("Test 6, Total Heads 14 = " + maxHeads (arr2, m: 3)); //m = 3System.out.println("Test 7, Total Heads 10 = " + maxHeads (arr3, m: 1)); //m = 1System.out.println("Test 8, Total Heads 17 = " + maxHeads (arr3, m: 2)); //m = 2System.out.println("Test 9, Total Heads 23 = " + maxHeads (arr3, m: 3)); //m = 3System.out.println("Test 10, Total Heads 28 = " + maxHeads (arr3, m: 4));//m = 4System.out.println("Test 11, Total Heads 32 = " + maxHeads (arr3, m: 5));//m = 5System.out.println("Test 12, Total Heads 35 = " + maxHeads (arr3, m: 6));//m = 6OUTPUT DEBUG CONSOLE JUPYTERPasteFont Paragraph StylesDictateSensitivity EditorQuestion #2: Game DesignYou are creating a game where the hero, called Hercules, has to fight n angryand magical birds with multiple heads. The ith bird has birds[i] total number ofheads.Assume it takes your hero 1 second to behead all heads of a specific bird, butafter that magically this bird gets back half of its heads. If the bird had initially bheads, then after it is beheaded it grows floor(b/2) heads back.You have m seconds to cut as many heads as possible from the birds.a) Describe an efficient algorithm that finds the maximum number of heads cutby Hercules. Hint: start with the bird that has the maximum number of heads,etc.b) Write a java class that implements your algorithms (copy pasteimplementation).c) What is the data structure you used? Hint: Some options arrays, sortedarrays, linked lists, heaps etc. Choose the best.d) What is the running time of your algorithm?//given an array @birds of size n, and @m the available seconds return the//maximum number of head cut by the heroint maxStymphBirds(int[] birds, int m)birds = [20, 1, 15]output = 45OutputA single integer, the maximum number of heads you can cut in m seconds.Example 1n = 3m = 3

Solution: maxStymphBird function Implementation: public static int maxStymphBird(int arr[],…

public class Main static int maxHeads (int[] birds, int m) { return 0; } } Run Debug public static void main(String[] args) { int arri] = {20, 1, 15); int arr21] (2, 1, 7, 4, 2); int arr3] (4, 10, 6, 7, 3, 1); System.out.println("Test 1, Total Heads 20 = " + maxHeads (arr1, m: 1)); //m = 1, bird 1 cut 20 heads, arrl is now (10,1,15) System.out.println("Test 2, Total Heads 35= " + maxHeads (arr1, m: 2)); //m2, bird 3 cut 15 head, arr1 is now (10,1,7) System.out.println("Test 3, Total Heads 45= " + maxHeads (arr1, m: 3)); //n = 3, bird 1 cut 10 heads, arrl is now (5,1, 7) System.out.println("Test 4, Total Heads 7 = " + maxHeads (arr2, m: 1)); // = 1 System.out.println("Test 5, Total Heads 11 = " + maxHeads (arr2, m: 2)); //m = 2 System.out.println("Test 6, Total Heads 14 = " + maxHeads (arr2, m: 3)); //m = 3 System.out.println("Test 7, Total Heads 10 = " + maxHeads (arr3, m: 1)); //n = 1 System.out.println("Test 8, Total Heads 17=" + maxHeads (arr3, m: 2)); // 2 System.out.println("Test 9, Total Heads 23= " + maxHeads (arr3, m: 3)); //n = 3 System.out.println("Test 10, Total Heads 28 = " + maxHeads (arr3, m: 4));//m4 System.out.println("Test 11, Total Heads 32= " + maxHeads (arr3, m: 5));//n = 5 System.out.println("Test 12, Total Heads 35 = " + maxHeads (arr3, m: 6));//n = 6 MS 2 OUTPUT DEBUG CONSOLE JUPYTER Question #12: Game Design You are creating a game where the hero, called Hercules, has to fight n angry and magical birds with multiple heads. The ith bird has birds[i] total number of heads. Assume it takes your hero 1 second to behead all heads of a specific bird, but after that magically this bird gets back half of its heads. If the bird had initially b heads, then after it is beheaded it grows floor(b/2) heads back. You have m seconds to cut as many heads as possible from the birds. a) Describe an efficient algorithm that finds the maximum number of heads cut by Hercules. Hint: start with the bird that has the maximum number of heads, etc. b) Write a java class that implements your algorithms (copy paste implementation). c) What is the data structure you used? Hint: Some options arrays, sorted arrays, linked lists, heaps etc. Choose the best. d) What is the running time of your algorithm? Ilgiven an array @birds of size n, and @m the available seconds return the //maximum number of head cut by the hero int maxStymphBirds(int[] birds, int m) Output A single integer, the maximum number of heads you can cut in m seconds. Example 1 n=3 m = 3 birds = [20, 1, 15] output = 45