(1500U30-1) 5 11. This algorithm duplicates a three-dimensional array of length n. You can assume the array (myArray) has already been populated with data. © WJEC CBAC Ltd. (a) Evaluate the efficiency of the algorithm and using Big O notation, determine the growth rate for time performance. [5] (b) Determine the growth rate of memory space during a single run of the algorithm. [2] (c) Identify the type of time complexity and draw a graph of the algorithm to illustrate the order of time performance. Graph paper is not required. [2] 12. Describe how data may be recovered if lost. [4] 13. Discuss the importance of codes of conduct in promoting professional behaviour throughout the software development stages. You should draw on your knowledge, skills and understanding from a number of areas across your computer science course when answering this question. [12] END OF PAPER 1 declare i,j,k,n as integer 2 declare myArray[n,n,n] 3 declare myArrayCopy[n,n,n] 4 5 set i = 0 6 set j = 0 7 set k = 0 8 9 for i = 0 to n - 1 10 11 for j = 0 to n - 1 12 13 for k = 0 to n - 1 14 15 set myArrayCopy[i,j,k] = myArray[i,j,k] 16 17 next k 18 19 next j 20 21 next i BLANK PAGE 6 © WJEC CBAC Ltd. (1500U30-1) © WJEC CBAC Ltd. BLANK PAGE (1500U30-1) 7 © WJEC CBAC Ltd.