Using the Big O notation, estimate the time complexity of the code below. Briefly explain how you derive your answer.

public static void printArray(int[] m) { for (int i=0; i < m.length; i++) { System.out.print(m[i]); } for (int i=m.length-1; i>=0; i--) { System.out.print(m[i]); } }