book name opendatastructure

Design and implement in C\# the efficient List operations on a Singly Linked List (SLL) of characters: - get(i) [3 points] - set(i;x)[3 points] - add(i,x)[7 points ] - remove(i) [7points] Each of these operations stould run in O(i) time. You may use chatGPT for a draft, but your final draft must use the same class, variable, and method names as the book! Group Part of AA3 - Question 2 [60 / number of group members / 2 points] You will receive an exercise question by email from Chapter 3, Section 3.4 (Discussion and Exercises) from the book. All group students will cooperate to solve all assigned questions, then each student will present (Not video-present) the solution for the question assigned to him/her. Each student will have 60150 seconds to present. The grade of a group member will depend on the correctness of the questions (a group mark) and the member's performance in the presentation. Even questions that were not completely solved by the group must be presented! All students should make sure they attend other groups' presentations day (Monday 13's class) since that's an important part of the course's material. Your group and you will team up with chatGPT to solve the exercises and check their correctness. Please consider the following case: I asked chatGPT to solve Exercise 3.2 in pseudocode. (I basically copied the question and then tried to restrict the answer to pseudocode). The response I got had several major problems: 1. It's not really in pseudocode, but it is in kotlin. 2. It's wrong! Very wrong!! While it is correct to initialize "slow" and "fast" this way before the while loop starts, 2. It's wrong! Very wrong!! While it is correct to initialize "slow" and "fast" this way before the while loop starts, slow = this.sentinel.next fast = this.sentinel.next.next It is totally incorrect to make fast "jump" by two steps in each iteration of the while loop. while fast.next is not null slow=slow.nextfast=fast.next.next return slow.val This will cause one of two problematic results for any SLL of decently large size (e.g. greater than 5 links): If you are lucky, the program will not throw an exception but will return aa node that is far from being the second last. It will be more towards the central lir If you are not so lucky, the program will throw an exception for trying to access next of a null object! Design and impiement an sust method, second last t, that returns the second-last element of an sulist. Do this without using the member variable, n, that keeps track of the size of the Ist. Use pseudocode Here's the implementation of the "secondlast( ) ' method in pseudocode: kotlin Copy code class Node val: int next: Node functionNode(val,next=nu11)this.val=valthis.next=nextln Class SLlist sentinel: Node function SLList() thissentinel=newNode(nuli) function secondlast() if this. sentinel. next is null raise "ist is enpty" If this. sentinel. next, next is nu11 raise "-ist has only one elenent" slow = this sentinel. next fast = this, sentinel, next, next Hile fast. next 15 not nu11 slow = slow, next fast = fast, , x xt, next