1. What is Big-O notation used for? (a) shows the minimum data set size (c) shows an alternative algorithm (b) shows the maximum data set size (d) a method to compare the efficiency of an algorithm 2 Which class would be best to use as the node for a linked list that stores the names of flora? class Node class Node class Node class Node float TheData Node Nexti int Flora Node Left, RightNode NextNode Node () String FloraName int FloraName Node Next Node ) Left null Right null; Next null 3. Which class would be best to use as the node for a binary tree that stores prime numbers? class Node class Node class Node class Node int Number: Node Left, Right:N Node ) String Number Node Left, Right float TheData Node Next int Number: Node Next Node ) ext nul1 Left nul1 Rightnull 4. What is the Big-O of a linked list search? (a) O(n (b) O(n) (c) O(n log(n) (d) O(logta)(e) O(a) 5. What is the Big-O of a binary tree search? (a) O(n (b) O(n) (c) O(n log(n) (d) Ollogn) (e) O(a) 6. Why did we use the exception handler in our programs? (a) needed for recursive programs (c) needed for the graphing library (b) needed for programs with pointers (c) needed for file input 7. A line of people waiting to buy movie tickets is a good example of a (a) stack (e) theaters should charge more (c) linked list (d) binary tree (b) queue 8. A buffer of data waiting be transmitted onto a data line is a good example of a (a) stack (b) queue ()linked list (d) binary tree(e) people downloading too many movies