in C programming

Complete the following function to remove the last node from the linked list that matches the search key key. Return the numerical index of the node that you removed. If no node is removed, return -1. You can assume the list is not empty. You have been given an initial approach that iterates over the list. You are allowed to declare new variables to aid your solution. Finish the details of the function and make sure there are no memory leaks. int lenovel List*, int key asserti I MOLL L-Count > 0) Liste te List white ON THE For the next few questions, assume the following definitions for a two-way linked list that has a header block of type List and list elements of type ListNode. typedef struct Modelag int NodeIten; struct NadeTag *next; struct ModeTag "press Listhode; int typedef struct Lista Count: ustode Itenlist ) List ust. Initiale List L - (List*) malloc(sizeof(list)) - Count = 0; let List ite count betero, and L->testist - NULL " the link to its list of items be MULL/ return