Part 4: Algorithm Analysis 1. Given the following algorithms below, give a f(n) such that R(n) e O(f(n)) where R(n) is the running time for input of size n. For each problem, you must provide justification. Proper justification must include i) a written explanation and ii) a diagram and/or mathematical reasoning. e. R(n) is the running time of strange_sumA in terms of n, the length of arr. int strange_sumA (int[] arr) { if (arr.length == 1) { return arr[e]; } else { int newlen = arr.length/2; int[] arrLeft = new int[newlen): int[] arrRight = new int[newlen); for (int i=0; i