It would be safe to have a driver for this search function, in the case:

```
1 bool search( Node ptr, Bird & bird, Bird dove )
2 {
3 if ( ptr == NULL )
4 return false;
5 if ( ptr->info == dove ) {
6 bird = ptr->info;
7 return true;
8 }
9 return search( ptr->next, bird, dove );
10 }
```
which is called for a linked list (where start points to the first node) using the lines of code:
```
if ( search( start, bird, dove ) )
cout << “search successful” << endl;
```
A. that the linked list is empty
B. that there is no dove in the linked list
C. A driver would not help to safeguard against any adverse conditions.
D. that there is more than one dove in the linked list

1