3. Write an iterative function insertAfter (Nodex head, int x) for a singly linked list. If a node with value x is found on the list, the function inserts (3 * x) after that node and returns true. If x is not found, nothing gets inserted and the function returns false. Make sure to cover all the edge cases. [24 points] struct Node { int data; Node* next; }; Ex. 1 5 3 87 // linked list insertAfter (head, 3); // returns true 1 53 - 987 insertAfter (head, 6); // returns false 15 3 9 8-7