For the given question use C language (DO NOT USE C++ OR JAVA). Write a C function whose prototype is given below int Check Circle (struct Node * Start); Function takes a Start pointer of an unordered Linked List as parameter. By looping, function determines whether or not there is a circle in the linked list. • It returns TRUE (1) if a circle is found, otherwise it returns FALSE (0). Example : The following is a Linked List with a circle (note that data duplicates are allowed). Start 20 10 40 50 30 10

You may do this assignment using either Java or C++. Do *not use the JDK LinkedList class or any linked list library! A linked list consists of zero or more nodes, which each contain one item of data and a link (Java reference, C++ pointer or reference) to the next node, if there is one. Linked List code is usually generic, so that you can use it to create a list of Strings, Students, Doubles, etc. For this assignment, you will write a simplified version of linked list that only can be used to create and use a list of ints and that has only a few of the functions typical of linked lists. The data element can be just an int, and the data type of the link to the next node can be just Node. You will need a reference (Java) or either a reference or a pointer (C++) to the first node, as well as one to the last node. Write a method/function that takes an in, creates a node with that int as its data value, and adds the node to the end of the list. This function will need to update the…

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++! The “data.txt” file has three lines of data    100, 110, 120, 130, 140, 150, 160    100, 130, 160    1@0, 2@3, 3@END        You need to    create an empty unsorted list  add the numbers from the first line to list using putItem() function.   Then print all the current keys to command line in one line using printAll().  delete the numbers given by the second line in the list by using deleteItem() function.  Then print all the current keys to command line in one line using printAll()..    putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list.    Then print all the current keys to command line in one line…