to define a function (named insert_asc) using what we just learnt, to traverse a linked list with double pointer to insert a value into the linked list in ascending order Assume: we already have the setup as below: Typedef struct node node; struct node { int data; node *next; } int insert_asc(node** phead, int value) ; /* return 1 if inserting is succeeded; return 0 otherwise */