For each of the following algorithms performed on a collection of n integers, write down its worst$-$case order of complexity as a function of n in simplified Big O notation. Assume that the most efficient data structure and algorithm are used. AlgorithmWorst$-$case order of complexityPop an element from a stack, where the stack is implemented using a singly$-$linked list and the tail node is always top of the stack. Cloning a doubly$-$linked list Finding the first occurrence of a given target in an integer array. Cloning a LongIntegers with n digits, as implemented in the first programming assignment. Adding two LongIntegers with n digits, as implemented in the first programming assignment.