$($a$)$ Write C$/$C$++/$Java$/$or precise pseudocode for the following data structure. We create a singly linked list which supports two operations: $(1)$

insertF and $(2)$ reportMin. While insertF is the same as we saw in class

$($and the zeroth programming hw$),$ reportMin returns the minumum key

value among the elements that are currently in the linked list $($without

deleting$).$ Clearly describe the Node class and LinkedList class along with

their members and functions. Both the operations must run in $O(1).$

For example, the sequence of operations insert $F(5),$insertF$(3),$ insert $F(6),$

reportMin$(),$ insertF$(2),$ reportMin$(),$ will report $3$ at the first report$-$

Min$()$ and will report $2$ at the second reportMin$()$ operation.