Can someone explain it to me. Modify the remove method in the UnorderedList class as follows.When the item is found in the UnorderedList, remove the item from the linked list and returnа.True.b. When the item is NOT found in the UnorderedList, return False.Modify the UnorderedList class as follows.Implement the index(self,item) method.i. When the item is found, this method should return the position of the item in theUnorderedList. Note: the item at the head of the list is at position zero, the next item is atposition one, and so on.ii. When the item is NOT found, this method should return -1.b. Implement the insert(pos, item) method.i. When pos is not valid, return False. Note: the pos value is invalid if it is less than zero orа.greater than size().ii. Otherwise, insert the item at the pos position so the item just inserted is at this indexposition after thzero, the next item is at position one, and so on.nsert has completed. Note: the item at the head of the list is at positionIn your source code file, add test code to test your modifications to the UnorderedList class.Think about the test cases you need to implement for each modification you made.Be sure to apply separation of concerns and design for reuse when developing your test code.а.b. from Node import Nodeclass Node:definit(self,initdata):class UnorderedList:self.data = initdatadefinit(self):self.next = Noneself.head = Nonedef getData(self):return self.datadef add(self,item):= Node (item)temptemp.setNext(self.head)self.head = tempdef getNext (self):return self.nextdef search (self,item):current = self.headdef setData (self,newdata):found =Falseself.data = newdatawhile current != None and not found:def setNext(self,newnext):if current.getData ()item:found =Trueself.next = newnextelse:current= current.getNext()return founddef remove (self,item) :current = self.headprevious = Nonefound = Falsewhile not found:if current.getData()item:found = Trueelse:previous= currentcurrent= current.getNext()if previousself.head = current.getNext()None:==else:previous.setNext(current.getNext ())def isEmpty(self):return self.head == Nonedef size(self):current = self.headcountwhile current != None:count =count + 1current= current.getNext ()return countdefstr(self):result =current = self.headwhile current != None:if len(result) > 0:result =result + ",'result = result + str(current.getData () )current = current.getNext()return "UnorderedList:" + result

a) In this it tells us that if we found an item in the Unorderedlist remove the item from the linked…

Answered: Can someone explain it to me.

Can someone explain it to me.

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

Similar questions

What year did John von Neumann create the first computer?
What year did Tommy Flowers produce the Colossus album?
John von Neumann was a native of what city?
Hi， what if i want random numbers without repetition.
computer Is there anything you know about Ada Lovelace's ideas?
How can you make your code more suited to the present moment?
Whose hands did The Glass Cage's words rest in?
Is playing video games on a computer beneficial or harmful to human beings in the long run? What justifications do you have for holding this belief?
What are UTMs or Universal Turing machines?
I don't understand, can you explain more?
What year did John von Neumann create the first computer?