Computer Science Conceptual Questions: Suppose you want to visit every element of a single linked list. For each of the following techniques, indicate the overall Big-O and explain your answer. DO NOT WRITE ANY CODE.

a. Have a loop that calls get() on each list element (i.e., list.get(0), list.get(1), list.get(2), etc.). Assume the get method is defined.

b. Create an iterator over the list, and have a loop that repeatedly calls next() using that iterator until it runs out of elements.