8 What is the worst case time complexity of inserting a node at the end of the doubly linked list with N elen V O(log N) OO(Nlog N) OO(N) O 0(1) Question 9 Which of the following statements can insert the node pointed by the pointer cur after the node pointed by t the elements in the list are 10, 20, 30, 40? struct NodeType F2 80 # 3 F3 E SA 4 ODO F4 R % F5 26 T MacBook Air A A 6 F6 Y & 7 F7