What is the time complexity in big Oh for the following Java method? public void F1(int n) { for (int i =1; i<= n; i++) { int x = 1; } }

Your Answer should include a brief explanation.