What are the running times of the following function in the best and worst cases? int sum(int list[], int size) \{ int sum =0; for (int index =0; index sum = sum + list [index]; return sum; \} Your answer: Best: O(1) Worst: O(n) Best: O(lgn) Worst: O(n) Best: O(n) Worst: O(n) Best: O(n) Worst: O(nlgn) Best: O(n) Worst: O(n2)