1. (Assessing ILOs: 1, 2, and 3)

Given the following inclusions and type definitions:

#include

#include

structdnode_int;

typedefstructdnode_int *dnode;

structdnode_int

{

dnode previous;

void *data;

dnode next;

};

structcirque_int;

typedefstructcirque_int *cirque;

structcirque_int

{

dnode cursor;

};

And the following function definition:

int f1(cirqueq)

{

dnode c;

int n = 0;

c =q->cursor;

while (c !=q->cursor)

{

n++;

c = c->previous;

}

return n;

}

1. What does the functionf1() do?

Click or tap here to enter text.

[6 marks]

2. What possible situation(s) could cause the code to fail?

Click or tap here to enter text.