Question 2 (a). A programmer has declared a three-dimensional array BRAUT in a programming language using BRAUT(2:11, -4:9, 5:12] (i). Describe (without calculating) how he will: (a). find the lengths of the three dimensions of BRAUT (B). find the number of elements in BRAUT. AN[3 marks 2 AN[2 marks (ii). Explain a practical example in a university management system where a four-dimensional array could be used. EV[5 marks] (b). People often use recursive algorithms. Discuss the difference between direct recursion and indirect recursion. In what situations would a direct or indirect recursion be a better choice to use? AP[5 marks (c). Two Level 200 IT students, James and Mary, are discussing how to compare two algorithms for solving a given problem. James suggests that they should use the execution times of the algorithms as criterion; but Mary insists that they should use the number of statements the algorithms execute as criterion. (i). Explain the reasons why both criteria they are considering are not good for comparing algorithms. (ii). What ideal solution/criterion would you recommend to them to use for comparing algorithms? Explain your answer with a practical example. AN[5 marks Animale