In main, you will read in an input filename and re-prompt until a valid input file is read, once the filestream could be opened, you will read the file, the file will contain the following: an integer that denotes the amount of test cases (or the amount of streets the hamburglar will hit), then for each test case, there will be an arbitrary series of numbers that denotes the amount of hamburgers in a restaurant, each test case will be terminated with -1. then for each test case, output the max number of hamburgers the hamburglar can steal from that street. the amount of restaurants on the street is unknown, thus you will need to have a pointer that will constantly resize the dynamic array, we also want to save memory so you don’t want to allocate too large of an array, so allocate an array of size 5 and everytime the array fills up, allocate 5 more elements to the array. you may need to deallocate the array after each test case is finished.

This problem has been solved! see the answeran evil king has a cellar containing n bottles of expensive wine, and his guards have just caught a spy trying to poison the king’s wine. fortunately, the guards caught the spy after he succeeded in poisoning only one bottle. unfortunately, they don’t know which one. to make matters worse, the poison the spy used was very deadly; just one drop diluted even a billion to one will still kill someone. even so, the poison works slowly; it takes a full month for the person to die. design a scheme that allows the evil king to determine exactly which one of his wine bottles was poisoned in just one month’s time while expending at most o(logn) of his taste testers.you are not allowed to use n testers, one for each bottle, and see which one tester dies after 30 days.(no pseudocode needed. just answer in words, how many testers you use, how you use them and why you correctly identify the poisoned bottle in 30 days)

1. which of the following is a search engine? a) mozilla firefox b)internet explorer c)google d)safari 2. which of the following statements is true? a) all search engines will provide the same results when you enter the same query. b) all search engines use the same amount of advertisements. c) some search engines are also browsers. d) search engines often provide different results, even when you enter the same query.

Where are american poets found in the dewey decimal system