How is the access time complexity to an element by index evaluated in a linked list?

In a linked list, access to an element by index requires sequential traversal from the beginning of the list to the desired element, since elements are not stored in a contiguous memory area. Therefore, the time complexity of index access is O(n), where n is the index of the element. For example, to get the 5th element, you need to traverse through 4 previous nodes.