Consider the following code:

public void printList(ArrayList<String> list) {

for(int i = 0; i < list.size(); i++)

      System.out.println(list.get(i));

}

What is the time complexity?

For the problem solved above, answer the following items:

1. What is the running time of the algorithm implemented? Explain your thought process behind the implementation
2. Describe in detail the running time breaking down each part of the code implemented into its respective runtimes 
3. If your code does not meet the minimum runtime requirements, add below a pseudocode of your implementation for the optimal solution. It does not have to follow any specific syntax, it's pseudocode. (If it does meet the minimum requirements, ignore this question)

What's the main difference between Method Overriding vs Method Overloading?