申論題

Please select all the correct answer(s) to question 1 to 10. Note that there could be O to 5 correct answ wers. If non answer is correct, answer "none". If you do not wish to answer a question, leave it blank. All 10 answer rs m must be written on the first page of your answer book, and the answer to question 1 must be in the first line, the answer to question 2 must be in the second line, and so on. If you fail to follow these rules then your answers will be ignored. ne of the a
1. (3 points) Let f(n) be the number of additions in the following algorithm.  1.f(n)=
2. f(n)=O(n²logn)
 3. f(n)=O(n³)
4. f(n)=O(n³logn)
 5. f(n)=