Consider an unrolled linked list with $n$ elements.This list stores multiple elements in each node.
What is the worst case time complexity to find the $k^{th}$ element if the number of nodes and the
number of elements in each node are equal?
$A)O(n)$ $B)O(\sqrt n)$
$C)O(nlogn)$ $D)O(n^{2})$