Consider a SinglyLinked List 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? Ollogn) O O(n) O(n) 012")