What are the time complexities of finding $8$th element from beginning and $8$th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n $>8.$

Select one:

a$.$ O$($n$)$ and O$($n$)$

b$.$ O$(1)$ and O$(1)$

c$.$ O$(1)$ and O$($n$)$

d$.$ O$($n$)$ and O$(1)$