NODE get_last(NODE **first_node) {
        NODE *brsw_node;

        if (first_node->next == NULL) {
                return(first_node);
        }
        brsw_node = first_node->next;
        while(brsw_node->next != NULL) {
                brsw_node = brsw_node->next;
        }
        return(&brsw_node);
}