could someone help me finish the selection sort function?

#include using namespace std; struct Node { int data; Node* next; }; void selectionSort(Node *start) { Node *i, *j, *min_node; // Traverse through the linked list //write your code here // Find the minimum node in the remaining unsorted list //write your code here // Swap the data of the minimum node with the current node //write your code here void printList(Node* start) { //write your 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 selection sort selectionSort(start); cout << "Sorted Linked List: "; printList(start); return 0; }