Provide best-case and worst-case running time and space complexity analysis in Big-Oh notation for the following pow_2 method. For each case, provide an example input pair and brief explanation.

4. (20 Points) Provide best-case and worst-case running time and space complexity analysis in Big-Oh notation for the following pow 2 method. For each case, provide an example input pair and brief explanation, Big-O Notation Example Input Explanation Best-Case Running Time Worst-Case Running Time Best-Case Space Complexity Worst-Case Space Complexity public static long pow_2(long x, int n) { if (n-0) if (n1) if(n % 2-0) { return 1; return x; return pow 2( x, n / 2) pow2x, n/ 2 ); return pow 2(x * x, n / 2) * x; else