could someone help me finsih the bubble sort function?

#include using namespace std; struct Node { int data; Node* next; }; void bubbleSort(Node *start) { bool swapped; Node *ptr1; Node *lptr = NULL; // Traverse through the linked list //code here // Compare adjacent nodes and swap if necessary //code here void printList(Node* start) //code here int main() { // Create a sample linked list Node *start = new Node; start->data = 3; start->next = new Node; start->next->data = 1; start->next->next = new Node; start->next->next->data = 4; start->next->next->next = new Node; start->next->next->next->data = 2; start->next->next->next->next = NULL; cout << "Original Linked List: "; printList(start); // Sort the linked list using bubble sort bubbleSort(start); cout << "Sorted Linked List: "; printList(start); return 0; }