<prompt> Theha algorithm ho tlosa tse kopitsoang lenaneng le hokahaneng le le leng.nan  <response>: Instruction in English: Create an algorithm to remove duplicates from a singly linked list. . Response in English: Here is an algorithm to remove duplicates from a singly linked list. Note: This solution assumes that the singly linked list contains comparable and hashable values.1. Create a new, empty hash set. This will be used to keep track of the values we have already encountered in the linked list.2. Set current to the head of the linked list and prev to None.3. Start a while loop that will continue until current is None: a. If the value of current is in the hash set, then it is a duplicate. Set the next attribute of prev to current.next, effectively skipping over current and removing it from the linked list. b. If the value of current is not in the hash set, add it to the set, and set prev to current. c. In either case, move current forward by setting it to current.next.4. The duplicates have now been removed from the singly linked list.Here is the same algorithm expressed in Python-like pseudocode:def remove_duplicateshead: values set current head prev None while current is not None: if current.val in values: prev.next current.next else: values.addcurrent.val prev current current current.next . Response in Sesotho: Mona ke algorithm ea ho tlosa tse kopitsoang lethathamong le hokahaneng le le leng. Tlhokomeliso: Tharollo ena e nka hore lethathamo le hokahaneng le le leng le na le litekanyetso tse ka bapisoang le tse hashable. 1. Theha sete e ncha, e se nang letho. Sena se tla sebelisoa ho boloka tlaleho ea litekanyetso tseo re seng re kopane le tsona lethathamong le hokahaneng. 2. Beha current ho hlooho ea lenane le hokahaneng le prev ho Ha ho letho. 3. Qala loop ea nakoana e tla tsoelapele ho fihlela hajoale e le Ha ho letho: a. Haeba boleng ba current bo le ho sete ya hash, e tla be e le phetiso. Hlophisa tšobotsi ea e latelang ea prev hore e be ea hona joale.e latelang, u tlole hona joale me u e tlose lethathamong le hokahaneng. b. Haeba boleng ba current bo le sieo ho hash set, e kenye sehlopheng, me u behe prev ho current. c. Leha ho le joalo, isa current pele ka ho e beha ho current.nex. 4. Likopi li se li tlositsoe lenaneng le hokahaneng le le leng. Mona ke algorithm e tšoanang e hlahisitsoeng ka Python-like pseudocode: def remove_duplicateshead: values set current head prev Ha e teng ha hajoale e se Che: haeba hona joale.val ka boleng: prev.next ea joale .e latelang: values.addcurrent.val prev jwale ya jwale ya jwale.e latelang 