1. Given the regular expression [A-Z]+[0-9]{4} , state which of the strings below will be fully matched:

COMP8901, INF0211*, INFOCOMP, FOUn2110, DATA112, SWEN21101, SAPPER5555

2. The values 10, 54, 12, 70, 5 have been inserted (in the order specified) into a (minimizing) binary heap. Draw diagrams that show the process of inserting EACH value into the heap

3. Briefly explain why the time to search alinked list is (n).

4. How do you fix a 4 node critical cluster in a Red Black Tree?

5. With the aid of diagrams explain the time complexity between the Insertion Sort and the Merge Sort

6. Write down an expression that represents the running time of Prims MST in terms

of the number of nodes (n) and the number of edges (m).

i. If a list based data set was used to store node information.

ii. If a binary heap-based priority queue was used to store node information.

Write down the recursive definition for implementing a pointer.