Linked list functions :In this part of the assignment, you will implement a basic singly linked list that is optionally sorted. The init function simply initializes the linked list and configures it based on a provided comparison function pointer. If the comparison function pointer is NULL, this indicates the list should be unsorted, and insertions occur at the head of the list. If the comparison function pointer is non$-$NULL, it provides the desired comparison function for sorting the list in increasing order. The insert function is responsible for inserting a new node into the list based on the comparison function. The remove function handles removing all nodes that contain the specified shape pointer.

$//$ Initializes a singly linked list

$//$ If compare is NULL, the list is unsorted and new nodes are inserted at the head of the list

$//$ If compare is not NULL, the list is sorted in increasing order based on the comparison function

void linked$\_$list$\_$init$($linked$\_$list$\_$t$*$ list, compare$\_$fn compare$)$

$\{$

$//$ IMPLEMENT THIS

$\}$

$//$ Inserts a node into the linked list based on the list comparison function

void linked$\_$list$\_$insert$($linked$\_$list$\_$t$*$ list, linked$\_$list$\_$node$\_$t$*$ node$)$

$\{$

$//$ IMPLEMENT THIS

$\}$

$//$ Removes all nodes from the linked list containing the given shape

void linked$\_$list$\_$remove$($linked$\_$list$\_$t$*$ list, shape$\_$t$*$ shape$)$

$\{$

$//$ IMPLEMENT THIS

$\}$

$//$IN C