Explain, using Big-Oh notation, the running time of a function as described below.

The function (called counter) will count the number of values at are the equal to the element passed as a parameter is in a singly linked list (only _next values, not _prev).

class SLinkedList: def __init__(self): self.headval = None

class Node: def __init__(self, dataval=None): self.dataval = dataval self.nextval = None

# insert, delete and other stuff would go here

def counter(self, element): # the code would go here.

Describe the steps in plain language and the running time for each step. Then show the total running time.