   9. Referring again to the problem of dynamic programming problem considered in Question 8, what is the cost of matching the two substrings ELEPHAN and EALEP? (a) 3 (b) 4 (c) 5 (d) 6 (e) None of the above 10. Which of the following statements is/are true? (i) Dijkstra’s algorithm and the Fast Marching algorithm are identical (ii) Dijkstra’s algorithm finds the shortest Euclidean path in space (ii) Dijkstra’s algorithm finds the shortest path in a network (a) (i) only (b) (i) only (c) (ii) only (d) Both (i) and (i) (e) Both (ii) and (ii) 11.Which of the following statements is/are true? (i) Radiance represents perceived luminance (ii) Luminance gives a measure of the energy an observer perceives from a light source (i) Saturation is the aspect of colour that varies as white light is added to monochromatic light (a) (i) only (b) (ii) only (c) (i) only (d) Both (i) and (ii) (e) Both (ii) and (ii) 12. Which of the following statements is/are true? (i) Subtractive primary colours are used for printer inks (i) By mixing the three additive primary colours red, green, and blue, we can create all possible colours the eye can see (ii) Cone receptors are mainly used for night and peripheral vision (a) (i) only (b) (ii) only (c) (iii) only (d) Both (i) and (ii) (e) Both (ii) and (iii) 8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT and the TOP string is ELEPHANT. The following string operations have the conventional costs: Delete LEFT 1 Delete TOP 1 Match 0 What is the cost of matching two substrings ELEP to EALE illustrated by the shaded square d(3,4) in the table below? (a) 2 (b) 3 (c) 4 (d) 5 (e) None of the above E P H T E A L E P A T Z 0.