c++ 1. (A). Replace guess by a better name (showing the purpose of the algorithm) template bool Guess value item; // Update links and counter

c++

1. (A). Replace guess by a better name (showing the purpose of the algorithm) template bool Guess<:guess item guessnode newnode pointer to a new node allocate and store num there. if return false newnode->value item; // Update links and counter newNode->next-first; first -newNode; count+ return true (B). The Big O notation is (C). Briefly explain how did you get the answer to 1.B (D). What is the BigO? Defend your answer algorithm fun (n ) if( n EQUAL 1) print( n ) else fun n-l ) print(n ) fun (n -1) end if end fun