24DoublyLinkedListNode* sortedInsert(DoublyLinkedListNode* head, intdata) {if(!head) {head=newDoublyLinkedListNode(data);returnhead; }DoublyLinkedListNode* prev = nullptr;DoublyLinkedListNode* curr = head; while