please answer the question

2. Consider the below program. Provide the running time function (n) for it, and explain your answer in few lines. Show that T(n) (login) using only the definition of big- Theta notation. (5 marks] public class TwoSum public public static int count(int[] a) { int N = a.length; Assume that N is a power of 2. int cnt - 0; for (int i = 1; i