The following is defined for this question struct entry
{
int num;
entry * next;
};
entry * head, * cur, * pent;
int n = 5, cnt=0;
pent = new entry;
pent->num = 7;
pent->next = NULL;
for (cur=head;cur!=NULL;cur=cur->nex t)
{
if (cur->num >= n)
break;
cnt++;
}
cout << cnt< If entry, cur, head, num and cnt are defined as earlier and head points to a linked list of numbers, the above code displays
a. The total number of entries in the linked list if head is pointing to an ordered linked list.
b. The total number of entries which has a number less than n if head is pointing to an ordered linked list.
c. The total number of entries which has a number less than n.
d. The total number of entries which has a number greater than n.
e. The total number of entries which has a number greater than n if head is pointing to an ordered linked list.