Consider a SinglyLinkedList with n integer elements. In order to compute the sum, we can use a for loop to iterate and access each element by its index with the get(...) method to perform our computation. What is the best big O characterization of this approach?

		O(log n)
		O(n)
		O(n2)
		O(2n)