> What complexity does inserting an element at the back of a singly linked list of n elements have?

O(n) since we will need to traverse the entire linked list to reach the end