Question $8$

Assume enqueue$()$ is the algorithm that inserts a new item into a queue, and printBack$()$ is the

algorithm that displays a doubly linked list backwards. What is the Big O notation of the

following algorithm?

O$($nlogn$)$

$O(n^2)$

nlogn$)$

$O(n^{2}logn)$

$O(n)$