Write an algorithm for the following (algorithm not pseudocode, not implementation of codes) a. algorithm to insert a data X after a specific data item Y in the linked list b. algorithm to delete any node from the singly liked list where the key value of the node is known c. algorithm to delete a node from a doubly linked list d. algorithm to delete all nodes having greater than a given value, from a given singly linked list e. algorithm to add two polynomials using linked list

Please explain    Q#Do the time complexities of a singly linked list differ from the time complexities of the operations (update, insert, lookup, delete) of a doubly-linked list? Group of answer choices a. Yes, the Big-O complexities are different for some of the operations. Adding the additional pointer to the previous node in the doubly linked list makes half of the operations slower.   b. No, the Big-O complexities do not differ. While a Doubly linked list uses an additional pointer of memory, it does not in fact modify the Big-O run-time.   c. Yes, the Big-O complexities are different for all of the operations. Adding the additional pointer to the previous node in the doubly linked list makes all operations slower.

Can’t figure this out can you pls explain your solution I need to know the thought process.

ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1​,N2,⋯​ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…

Computer Science Questions

Sort the following list using the  Selection Sort algorithm . Show the list after each iteration of the outer for loop (after each complete pass through the list) IMPORTANT: Separate each value by a comma and only one space after each comma and no space after the last value. You will have seven iterations of the list for your answer. 38, 60, 43, 5, 70, 58, 15, 10