Answer Happy

What is the time complexity of the following code (Suppose m>0 and >1)? int func (int m, int n) { int i=0; while (m<100) { i++; } for (int i=0; i<n-1; i++) { for (int j =n; j>i; j--) return i*j; } } A. 0(m) B. o(²) C. o(m+n²) D. 0(1) m++;