A simplified linked list is used to store the names of flowers in alphabetical order. It is implemented using two 1D arrays: • Flower stores the names of the flowers. • NextPointer stores the pointer to the next flower name in the list. HeadPointer indicates the index of the first flower name in the linked list. HeadPointer 6 When the end of the linked list is reached, the next pointer has the value of 0. The following table shows the initial content of the arrays. Index Flower NextPointer 1 Rose 7 2 Marigold 1 3 Foxglove 10 4 Iris 9 5 Daisy 3 6 Dahlia 5 7 Saxifrage 0 8 Lupin 2 9 Lily 8 10 Hydrangea 4

1. (a)Several flower names have been deleted from the linked list. These are crossed out in the following table. Complete the table to show the new values of HeadPointer and NextPointer to keep the remaining flower names in alphabetical order. [Figure X.X][3]
2. (b)Complete the pseudocode algorithm so that it achieves the following when applied to the arrays: • The flower name is input. • The linked list is searched, in order, for the flower name. • If the flower name is found, an appropriate message is output to indicate it has been found. • If the flower name is not found, an appropriate message is output to indicate it has not been found. • The algorithm terminates when the next pointer value is 0. Pointer ← HeadPointer Found ← 0 OUTPUT "Enter a flower name " IF Flower [Pointer] = FlowerName THEN Found ← Pointer Pointer ← 0 ELSE ENDIF ENDWHILE OUTPUT Flower[Found], " is found" ELSE ENDIF[5]
3. (c)Explain how you could improve the simplified linked list structure.[2]

This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.