<prompt> Ngola laebrari ea C e sebelisang lenane le hokahanengnan  <response>: Instruction in English: Write a C library that implements a linked list . Response in English: Here is a simple implementation of a linked list in C:cppincludeusing namespace std;class Node public: int data; Node next; Nodeint d data d; next NULL; ;class LinkedList private: Node head;public: LinkedList head NULL; void addint d if head NULL head new Noded; return; Node temp head; while temp-next ! NULL temp temp-next; temp-next new Noded; return; void print Node temp head; while temp ! NULL cout temp-data ; temp temp-next; cout n; void removeint d if head NULL return; Node temp head; if head-data d head head-next; delete temp; return; while temp-next ! NULL temp-next-data ! d temp temp-next; if temp-next NULL return; Node to_remove temp-next; temp-next temp-next-next; delete to_remove; return; ; . Response in Sesotho: Mona ke tsebetsong e bonolo ea lenane le hokahaneng ho C : cpp include sebelisa namespace std; sehlopha sa Node setjhabeng: data int; Node e latelang; Node int d data d; latelang NULL; ; sehlopha sa LinkedList sephiring: Node hlooho; sechaba: LinkedList hlooho NULL; tlatsetso e se nang letho int d haeba hlooho NULL hlooho Node e ncha d; khutla; Node temp hlooho; ha temp- latelang ! NULL temp temp- latelang; temp- latelang Node e nchad; khutla; khatiso e se nang letho Node temp hlooho; ha temp ! NULL cout temp- data ; temp temp- latelang; cout n; tlosa lefeela int d haeba hlooho NULL khutla; Node temp hlooho; haeba hlooho- data d hlooho hlooho- e latelang; hlakola mocheso; khutla; ha temp-e latelang ! NULL temp-next-data ! d temp temp-e latelang; haeba temp- latelang NULL e khutla; Node ho_remove temp- latelang; temp- latelang temp- latelang- latelang; hlakola ho_tlosa; khutla; ; 