Linked-List

Consider a singly linked list having n nodes. The data items d₁, d₂, …d_n are stored in these n nodes. Let X be a pointer to the j-th node (1≤j≤n) in which d_j is stored. A new data item d stored in node with address Y is t be inserted. Give an algorithm to insert d into the list to obtain a list having items d₁, d₂, …, d_j-1, d_j, …, d_n in the order without using the header.