a function that would delete the first occurrence of an element from a list in Erlang

C++

C++

Please fill in the blanks for C. // Singly Linked List   #include<stdio.h>   // Part 1 //Declare a node of character // each node has a value and a pointer that points to the next node struct charNode {             __1__ val;             __2__ __3__ next; };   /*This function takes the first pointer (head) and iterates through the list             to print one character at a time.*/ __4__ printCharLL(__5__ __6__ curPtr) {             printf("\nPrinting back the list: \n");             while(__7__ __8__ __9__) //condition to keep running the loop             {                         printf("%c", __10__);  //print the value using pointer, no spaces                         curPtr = __11__; //move the pointer to point to the next node in list, no spaces             }             printf("\n"); }   // Part 2 //Declare a node of double // each node has a value and a pointer that points to the next node struct doubleNode {             __12__ val;             __13__ __14__ next; };…

*Needs to be done in scheme interleave* Implement function interleave in scheme, which expects as arguments two lists x and y, and returns asingle list obtained by choosing elements alternately, first from x and then from y. When either x or yruns out, interleave takes the remaining elements from the other list, so that the elements of the resultare exactly the elements of the two argument lists taken together. (interleave '(1 2 3) '(a b c)) -> (1 a 2 b 3 c) (interleave '(1 2 3) '(a b c d e f)) -> (1 a 2 b 3 c d e f) (interleave '(1 2 3 4 5 6) '(a b c)) -> (1 a 2 b 3 c 4 5 6)

c++

Using C, Must be in C   Create a menu driven program that performs the following tasks (each task is a menu item):                            a. Create a doubly linked list of length 5 using dynamic allocation. Your linked-list should support method Write a function on to print the content of the linked list following its order. Write a function on to reverse the doubly linked list.  Write a function to Delete the first node in your doubly Linked list

def grade_manipulation(grade_list):    '''    Question    You are working as a TA and the professor asks you to handle the    uncleaned student grades.     - First, substitute all grades that are None with a 0    - Second, reverse the order of the student grades    - Third, change the type of the list to a tuple     Args:        grade_list (list)    Returns:        tuple     >>> grade_manipulation([67, 95, 60, None, 100])        (100, 0, 60, 95, 67)     ''"    # print(grade_manipulation([67, 95, 60, None, 100]))    # print('---')