Answer the following questions with either: A. The time depends on size of n and twice as large will likely require about twice the time. B. The time depends on size of n but twice as large will generally be less than twice the time. C. Constant amount of time regardless of size of n 14. How long will it take to insert an element at the head of a linked list of size n ? 15. How long will it take to remove an element from a doubly linked list of size n if you only have a pointer to the element you wish to remove and are unable to copy the data of the elements? 16. How long will it take to remove an element from a linked list of size n if you only have a pointer to the element you wish to remove? 17. How long will it take to insert an element at the beginning of an array of size n ? 18. How long will it take to delete element k (where k is close to 1/2n ) from an array of size n where order does not matter? 19. How long will it take to delete element k (where k is close to 1/2n ) from an array of size n where order does matter? 20. How long will it take to determine if an element exists in a sorted linked list of size n ? 21. How long will it take to determine if an integer exists in a sorted array of n integers? 22. How long will it take to correctly insert an element into an AVL tree of size n