In ADT List linked - based implementation, what does the following algorithm perform? Need: - newnode -previous node reference - after node Process: - get new node - store data get previous node previousNode= getNodeAt(pos -1) - get after node afterNode= previousNode.next - connect newNode.next-afterNode PreviousNode.next=newNode Select one: O A. replace at given position O B. add at given position 9 hp 3 get previous node previousNode=getNodeAt(pos-1) - get after node afterNode= previousNode.next - connect newNode.next-afterNode PreviousNode.next=newNode Select one: O A. replace at given position O B. add at given position O C. remove at given position O D. retrieve object at given position A recursive function defining the Fibonacci number nzz O CK