What is the corresponding worst-case time complexity, on an input size of n, for each of the following operations on the specified ADT?

Question 9 options:

1.	O(1) - constant time
2.	O(log n) - log(n) time
3.	O(n) - linear time
4.	O(n2) - quadratic time
5.	O(n3) - cubic time

	Delete the first element of a singly-linked list with only a head pointer to the first element of the list
	Delete the element at the end of a doubly-linked list with both a head and tail pointer (at the first and last elements, respectively)
	Pop operation on a stack ADT
	Delete the element at the end of a singly-linked list with both a head and tail pointers (at the first and last elements, respectively)
	Dequeue operation on a queue ADT
	Delete the first element of a circular singly-linked list with only a head pointer to the first element of the list
	Write at the ith indexed location of an array A, i.e., A[i]
	Delete the first element of a circular singly-linked list with only a tail pointer to the last element of the list
	Delete the element at the head of a doubly-linked list with both a head and tail pointer (at the first and last elements, respectively)
	Delete the first element of a circular doubly-linked list with only a head pointer to the first element of the list