What is the Big-O of the following? Careful! Tricky... Select the correct Big-O for the following: [O] A problem requires running an O(n) algorithm and then afterwards running an O(n) algorithm. [1] 10n + Mg(n^2) [2] log(n) + 100 [3] The code snippet below: for (int i = 0; i<>