Ignore the red writing. Help needed please!

For questions 2 through 4 assume the following definitions for a one-way linked list that has a header block of type List and list elements of type ListNode. 2. (15 points) Consider code listed below: ListNode*I=(ListNode*)malloc(sizeof(ListNode));INodeItem=2;Inext=(ListNode)malloc(sizeof(ListNode));ListNode*J=(ListNode*)malloc(sizeof(ListNode));JNodeItem=2;Inext=I;ListNode*K=(ListNode*)malloc(sizeof(ListNode));KNodeItem=3;Knext=Inextnext;ListNode*L=(ListNode*)malloc(sizeof(ListNode));LNodeItem=0;Lnext=Knextnext; ( 5 points) Draw a visual representation of what the code produces. (10 points) The function bellow adds 1 new node at the given index of a list. If the index is invalid, then it adds the node to the end of the list. However, there are several bugs! Describe at least 3 bugs in detail including what happens when the bug manifests