part (B) b no ar 1

void insert_last(int a)
{
    struct node *n;
    n = (struct node *) malloc(sizeof(struct node));
    n -> data = a;
    n -> next = NULL;
    temp = head;
    while(temp -> next)
    {
        temp = temp -> next;
    }
    temp -> next = n;
}