The bounded-buffer solution in the below code uses a last-in-first-out strategy (LIFO).Change the code to implement a FIFO (First-in-First-out) strategy. You may use the (in,out) pointer method(using semaphores to test if the queue is full or empty shouldalleviate the problem of only using up N-1 locations) or implement a FIFO queue. Usethe correct counting semaphore implementation. C code below ******************************************************************************************************************************* #include <stdio.h>#include <stdlib.h>#include <pthread.h>#include <semaphore.h>#define SIZE 5#define NUMB_THREADS 6#define PRODUCER_LOOPS 2typedef int buffer_t;buffer_t buffer[SIZE];int buffer_index;pthread_mutex_t buffer_mutex;/* initially buffer will be empty. full_semwill be initialized to buffer SIZE, which meansSIZE number of producer threads can write to it.And empty_sem will be initialized to 0, so noconsumer can read from buffer until a…

We assume that the nodes of the singly linked lists are organized in decreasing order of the exponents of the variable x in order to add the two polynomials.The goal is to build a fresh list of nodes to symbolize the addition of P1 and P2. This is accomplished by combining the COEFF fields of the nodes in lists P1 and P2 that have similar powers of the variable x, then adding a new node that reflects this action in the resulting list P1 + P2. The key steps of the process are presented below.Here, P1 and P2 are the single-linked lists that symbolize the polynomials P1 and P2, respectively. Furthermore, two temporary pointers named PTR1 and PTR2 have their initial values assigned to P1 and P2, respectively. Script out the process code

Given a circular linked list, implement an algorithm that returns the node at thebeginning of the loop.DEFINITIONCircular linked list: A (corrupt) linked list in which a node's next pointer points to an earlier node, soas to make a loop in the linked list.EXAMPLEInput: A -> B -> C -> D -> E -> C [the same C as earlier]Output: C

Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop.DEFINITIONCircular linked list: A (corrupt) linked list in which a node's next pointer points to an earlier node, soas to make a loop in the linked list.EXAMPLEInput:Output:A -> B -> C -> D -> E -> C [the same C as earlier]C

Consider a singly linked list where each node contains two fields – integerdata and node type pointer next. The head of the list and a value of the data isgiven. You have to find the node that contains the given data and delete thatnode. Data may occur at any position of the list including first or last. In caseof unavailability of the given data, you have to print a message. You have toImplement a delete operation of a singly linked list.Code in C

Consider a singly linked list where each node contains two fields – integerdata and node type pointer next. The head of the list and a value of the data isgiven. You have to find the node that contains the given data and delete thatnode. Data may occur at any position of the list including first or last. In caseof unavailability of the given data, you have to print a message. You have toImplement a delete operation of a singly linked list.

Implement a method to remove a node in the middle of a singly linked list (i.e., any node except the first and last node, not necessarily the exact middle), given only access to that node.EXAMPLElnput:the node c from the linked list a->b->c->d->e->fResult: nothing is returned, but the new linked list looks like a ->b->d->e->f

Given a singly linked list of integers, reverse the nodes of the linked list 'k' at a time and return its modified list. 'k' is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of 'k,' then left-out nodes, in the end, should be reversed as well.Example :Given this linked list: 1 -> 2 -> 3 -> 4 -> 5 For k = 2, you should return: 2 -> 1 -> 4 -> 3 -> 5 For k = 3, you should return: 3 -> 2 -> 1 -> 5 -> 4 Note :No need to print the list, it has already been taken care. Only return the new head to the list. Input format :The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow. The first line of each test case or query contains the elements of the singly linked list separated by a single space. The second line of input contains a single integer depicting the value of 'k'. Remember/Consider :While specifying the list…

Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link li. st looks like 1 -> 3 -> 4 ^ | |____|