Given this function, how would you do insertion sort on link list without changing the parameters

ex: 1-> 9 -> 2 -> 4

output: 1->2->4->9

there is a struct that has:

struct node {

int data;

struct node * next;

};

void sort_list(nodePT L)

{

}