Consider a Single Linked List (SLL) of nodes, where 'node' is a type with two fields: integer data and the node type reference 'next' that refers to the next node in the list. For each part given below consider the SLL and the code given in the second column. Following the execution of the code, show the resulting list (in the answer box, for each part, use the arrow key to draw the list as: head-----> ? -------> ? -------> ?). List and Java Code | head →1-2-3→4→ null node ptr=head; node newnode = new node(0); // data=0 head = newnode; newnode.next=ptr; b head 1→2→3→4→ null node ptr=head; node newnode = new node(6); // data=6 while(ptr.next!=null) { ptr=ptr.next; } ptr.next=newode; head -1-2- 3→ 4→ mull node ptr=head; ptr=ptr.next; head=ptr;

Write a C program to store, analyze and update Covid-19 information about Greater Toronto Area (GTA) for the health ministry of Ontario. This assignment mainly tests your ability to use linked lists.Data Collected:• Regions:o Peelo Yorko Durham• Towns:o For Peel▪ Brampton▪ Mississaugao For York▪ Maple▪ Vaughano For Durham▪ Whitby▪ Oshawa• Race of head of the household which is supposed to be one of the following:o African American, Asian, Caucasian, Indigenous, Other• Number of people in the household—must be an integer greater than 0 and less than 12;• Number of people tested positive for Covid-19 must not be more than number of people in the household;• Number of people fully vaccinated—must not be more than number of people in the household.InstructionsCreate an application that should:• Randomly populate information for one hundred households and store them in a linked list. It should be ensured that random generator correctly match region and town pairs as given above and enter…

A linked list cannot be used to represent a collection. This is a data structure that does not contain any data. Sets do not include any resemblance to one other. Union and intersection are examples of set functions that may be used to sets.

​Write a function that changes the places of the first and last nodes of a linked list. I.e. First node will become last node, and the last node will become first node. Others nodes will not be affected.THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.

Implement c# program to Retrieving a value using its associated key can be accomplished using an indexer, which works just like an indexer for an array. A key is passed in as the index value, and the value associated with the key is returned, unless the key doesn’t exist, in which a null is returned. you can use an indexer along with the Keys method to retrieve all the data stored in a hash table

Given a scenario where you need to efficiently insert elements at the beginning of a list, which type of linked list would be most suitable? Explain why.

What are the advantages of utilising a linked list instead of an array?   When should a Linked List be used and when should an Array be used?

Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at position 0, its parent is at 1 and so on.       Example     head refers to 3 -> 2 -> 1 -> 0 -> NULL   positionFromTail = 2       Each of the data values matches its distance from the tail. The value 2 is at the desired position.       Function Description       Complete the getNode function in the editor below.       getNode has the following parameters:   · SinglyLinkedListNode pointer head: refers to the head of the list   · int positionFromTail: the item to retrieve       Returns       · int: the value at the desired position       Input Format       The first line contains an integer t, the number of test cases.   Each test case has the following format:   The first line contains an integer n, the number of elements in the linked list.   The next n lines contains an integer, the data value for an element of…

3. Write a function to return the median value in a sorted linked list. If the length i of the list is odd, then the median is the ceiling(i/2) member. For example, given the list (1, 2, 2, 5, 7, 9, 11) as input, your function should return the value 5. If the length of the list is even, then the median is the mean of the i/2 and (i/2)+1 members. Thus, the median of the sorted list (2, 4, 8, 9) is (4+8)/2. Finally, define the median of an empty list to be 0.