<prompt> U etsa lethathamo le hokahaneng joang ho C?nan  <response>: Instruction in English: How do you create a linked list in C? . Response in English: A linked list is a linear data structure where each element is a separate object with a data part and a link part. The link part points to the next element in the list. To create a linked list in C, we start by defining a node structure, which should have a data member and a next pointer:cppstruct Node int data; Node next;;Next, we can create a class for a linked list that includes functions to manipulate the list:cppclass LinkedList private: Node head;public: LinkedList head nullptr; void insertAtHeadint value Node newNode new Node; newNode-data value; if head nullptr head newNode; head-next nullptr; else newNode-next head; head newNode; void display Node temp head; while temp ! nullptr cout temp-data ; temp temp-next; cout endl; ;Here, we have created a LinkedList class that has a private member head, that points to the first element of the list. The class has a constructor that initializes head to nullptr. It also has two public functions: insertAtHead to insert a new element at the beginning of the list, and display to display the entire list.Here is an example of how to create and manipulate a linked list:cppint main LinkedList list; list.insertAtHead1; list.insertAtHead2; list.insertAtHead3; list.display; return 0;This will create a linked list with three elements and display it. The output will be: 3 2 1. . Response in Sesotho: Lethathamo le hokahantsoeng ke sebopeho sa data se nang le mela moo ntho e ngoe le e ngoe e leng ntho e ikhethileng e nang le karolo ea data le karolo ea khokahanyo. Karolo ea lihokelo e supa ntlha e latelang lenaneng. Ho theha lethathamo le amanang le C , re qala ka ho hlalosa sebopeho sa node, se lokelang ho ba le setho sa data le pointer e latelang: cpp struct Node data int; Node e latelang; ; Ka mora moo, re ka theha sehlopha sa lenane le hokahaneng le kenyelletsang mesebetsi ho laola lenane: cpp class LinkedList private: Node head; sechaba: LinkedList hlooho nullptr; void insertAtHeadint value Node newNode Node e ncha; newNode- data boleng; haeba hlooho nullptr hlooho newNode; hlooho- latelang nullptr; tse ling newNode- latelang hlooho; hlooho newNode; pontso e se nang letho Node temp hlooho; ha temp ! nullptr cout temp- data ; temp temp- latelang; cout endl; ; Mona, re thehile sehlopha sa LinkedList se nang le hlooho ea setho sa poraefete, se supang karolo ea pele ea lenane. Sehlopha se na le sehahi se qalang hlooho ho nullptr. E boetse e na le mesebetsi e meli ea sechaba: insertAtHead ho kenya ntho e ncha qalong ea lenane, le splay ho hlahisa lenane lohle. Mohlala ke ona oa mokhoa oa ho theha le ho laola lenane le hokahaneng: cpp int main Lethathamo la LinkedList; list.insertAtHead1; list.insertAtHead2; list.insertAtHead3; list.bontsha; khutla 0; Sena se tla theha lenane le hokahantsoeng le likarolo tse tharo le ho le bontsa. Sephetho e tla ba: 3 2 1. 