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

public static void printArray2 (int[] m) { for (int i=0; i < m.length; i++) { for (int j=0; j < i; j++) { System.out.print(m[i] * m[j]); } } }