Explain what the following function serves for. Give a single sentence explanation. 1- Node* operation (Node* root, int k, int& count, int& result) { if (root-> left != NULL) operation (root->left,k, count, result) 123456 2 3 4 5- 6 7 8 9 10 11 } count++; if(count } k) { result root->data; return; == if(root->right) operation (root->right, k, count, result);