How would the given function be implemented based on the given prompt? **Question #2: 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?**```java// 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)```**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 = 45The 1st second, cut 20 heads of the 1st bird, and it gets floor(20/2) = 10 heads back. The 2nd second, cut 15 heads of the 3rd bird, and it gets floor(15/2) = 7 heads back. The 3rd second, cuts 10 heads of the 1st bird again, and it gets floor(10/2) = 5.In total 20 + 15 + 10 = 45 heads cut. ```javapublic class Main{ static int maxHeads(int[] birds, int m){ return 0; } public 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}; System.out.println("Test 1, Total Heads 20 = " + maxHeads(arr1, 1)); // m=1 System.out.println("Test 2, Total Heads 35 = " + maxHeads(arr1, 2)); // m=2, bird 3 cut 15 heads, arr1 is now {10,1,7} System.out.println("Test 3, Total Heads 31 = " + maxHeads(arr1, 3)); // m=3, bird 1 cut 10 heads, arr1 is now {5,1,7} System.out.println("Test 4, Total Heads 7 = " + maxHeads(arr2, 1)); // m=1 System.out.println("Test 5, Total Heads 11 = " + maxHeads(arr2, 2)); // m=2 System.out.println("Test 6, Total Heads 14 = " + maxHeads(arr2, 3)); // m=3 System.out.println("Test 7, Total Heads 10 = " + maxHeads(arr3, 1)); // m=1 System.out.println("Test 8, Total Heads 17 = " + maxHeads(arr3, 2)); // m=2 System.out.println("Test 9, Total Heads 23 = " + maxHeads(arr3, 3)); // m=3 System.out.println("Test 10, Total Heads 28 = " + maxHeads(arr3, 4));// m=4 System.out.println("Test 11, Total Heads 32 = " + maxHeads(arr3, 5));// m=5 System.out.println("Test 12, Total Heads 35 = " + maxHeads(arr3, 6));// m=6 }}```### Code ExplanationThis is a Java program containing a main class with a method

Solution: A) Algorithm for this Solution: 1. int findmax(arr): 1.1 max = arr[0] 1.2 for i in1 to…

Question #2: 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? //given 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

Question #2: 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? //given 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

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

What exactly do you mean when you say "logical function"? What is the other name for it? Can you give any instances of logical functions?
When a function calls another function in pep/9, describe the steps involved. How do they communicate information, and how does the calling software continue to run once the call is completed?
Create an original multiple-choice question on the topic of Defining and Calling a Function in Python. Include your original question and four original option/answer responses, mark the correct option/answer response with an asterisk preceding it. Do not use "None of the above" as a possible option/answer response. One correct option/answer response per multiple-choice question. Complete the Correct Option/Answer Verification Section with an original explanation as to why the correct option/answer is accurate.
Using C++ Using your own creativity, make a set of function templates that have these features: This function must return a value. A function template with 1 template parameter, T. And, any other parameters you want. and then another function template but this time with 2 template parameters, T1 and T2. And, any other parameters you want.
Write a statement that calls the function AddToStock with parameters computerInfo and addQty. Assign computerInfo with the value returned.