Question 9 4 pts The complexity of deleting a node (not the head or tail) from a linked list is... O O(log n) O O(n log n) O O(n) O O(1) Question 10 4 pts The complexity of prepending a node to a linked list is... O O(n) O O(n log n) O O(log n) O O(1) Question 11 4 pts Traversing an array and traversing a linked list both have linear time complexity. O True O False