need answer quickly , plss

Assume that the node of a linked list is in the usual data-next form with the data of type int. Initially linked list elements are stored in the order 30, 25, 72, 58, and 41. The following data, as described in part (a), is to be inserted: 48, in part (b) is to be searched: 72 and from parts (c) to (d) are to be deleted: 41, 30 in linked list: Suppose that head is a pointer of type node structure. After the linked list is created, head should paint to the first node of the list. Declare additional variables as you need them. Mention the steps in C program to implement (a) operation in the linked list. After insertion in the linked list, write a function named as search_node to implement (b) operation, write a function named as delete_node to implement (c) operation and mention the steps in C program to implement (d) operation Display the linked list as a final output. a. Insert 48 before 72 linked list. b. Search element 72 in link list c. Delete 41 from linked list. d. Delete first element of the list