Can anyone help me to solve this?

It's a C++ data structures course.

(a) Give the exact worst-case operation count for the function below, where list points at a linked structure of N nodes. Show all the details, counting every assignment, comparison, addition, etc. as 1 operation. void FindItem (Node * list, Item item, Node*& loc, bool& found) { bool more = true: loc = list: found = false, while (more && Ifound) { if (item