Answer Happy

C++ PLEASE LOOK AT CODE ATTENTIVELY!!! PICTURES ARE THE
HINTS!
insert an element to the ith position in the linked list
#include <iostream>

typedef int ElemType;

typedef struct LNode {
ElemType data;
struct LNode* next;
}LNode, *linkedList;


void showList(linkedList l) {
while (NULL != l) {
printf("%d\n", l->data);
l = l->next;
}
}
Input i: where j is added j: element to be added For example: suppose list I contains: 0 1 2 after inserting 0 to the 1st position, I contains: 0 0 1 2 Output the elements of the list

Sample Input Copy 1 1 Sample Output Copy © 1 W NA 1 2 3