Assume that SLL is a singly linked list with the head node (sample SLL shown below). The
declarations of the Node and singlyLinkedList are provided below. The head always points to the
first node of SLL. If SLL is empty, the head will be NULL. Assume that each node contains a
unique integer in SLL.
class Node { friend class singlyLinkedList; public: Node (); Node (int); Node (); int getValue ();
private: int value; Node next; }; class singlyLinkedList { public: singlyLinkedList (); singlyLinkedList
(); void addFront (Node *newNode); void swapNode (Node *tNode); int findSmallestInt (); void
displaySinglyLinkedList (); private: Node *head;(a) (5 Points) (a) Implement the function in C++, int
singlyLinkedList: :findSmallestInt (); that returns the smallest elements in an singly linked list
[ANSWER] (b) (5 Points) Based on the code you write in part (a), Explain the complexity in Big-
Oh. [ANSWER].
Introduction to ArtificiaI Intelligence in Higher Education
Assume that SLL is a singly linked list with the head node .pdf
1. Assume that SLL is a singly linked list with the head node (sample SLL shown below). The
declarations of the Node and singlyLinkedList are provided below. The head always points to the
first node of SLL. If SLL is empty, the head will be NULL. Assume that each node contains a
unique integer in SLL.
class Node { friend class singlyLinkedList; public: Node (); Node (int); Node (); int getValue ();
private: int value; Node next; }; class singlyLinkedList { public: singlyLinkedList (); singlyLinkedList
(); void addFront (Node *newNode); void swapNode (Node *tNode); int findSmallestInt (); void
displaySinglyLinkedList (); private: Node *head;(a) (5 Points) (a) Implement the function in C++, int
singlyLinkedList: :findSmallestInt (); that returns the smallest elements in an singly linked list
[ANSWER] (b) (5 Points) Based on the code you write in part (a), Explain the complexity in Big-
Oh. [ANSWER]
![Assume that SLL is a singly linked list with the head node (sample SLL shown below). The
declarations of the Node and singlyLinkedList are provided below. The head always points to the
first node of SLL. If SLL is empty, the head will be NULL. Assume that each node contains a
unique integer in SLL.
class Node { friend class singlyLinkedList; public: Node (); Node (int); Node (); int getValue ();
private: int value; Node next; }; class singlyLinkedList { public: singlyLinkedList (); singlyLinkedList
(); void addFront (Node *newNode); void swapNode (Node *tNode); int findSmallestInt (); void
displaySinglyLinkedList (); private: Node *head;(a) (5 Points) (a) Implement the function in C++, int
singlyLinkedList: :findSmallestInt (); that returns the smallest elements in an singly linked list
[ANSWER] (b) (5 Points) Based on the code you write in part (a), Explain the complexity in Big-
Oh. [ANSWER]](https://image.slidesharecdn.com/assumethatsllisasinglylinkedlistwiththeheadnode-230322032757-5b64ffae/85/assume-that-sll-is-a-singly-linked-list-with-the-head-node-pdf-1-320.jpg)
