Consider the following algorithm to insert an element in a triply linked list.insertelement(data) create a node with given data. if the linked list is empty _____________ _____________ if the given node is less than the head link the nodes through address and adjust the tail if the given node is not less than the head if the given node is equal to the head new node is inserted on top of the head else traverse the linked list to find an element greater than the node and insert in front of the node Which of the following option is best suited to fill the blank?

Options are not available for this question.

Answer: Option A