please answer the following questions

9. you can select more than one answer.

10. you can select more than one answer.

What scenarios should be considered 'special or edge cases' when creating a metirod to add a node to a sorted Linked List where the head and tail references point respectively to the beginning and end node of the list? Hint: special cases with lists usually involve changing the head/tail references. the list is empty the node needs to go at the end of the list the node sorts into the middle of the list if the node's element is the same datatype as the others the node needs to go at the front of the list If we insert node X after node L, which of the following nodes will have to change their "Prev" pointers