(1500U30-1) 5 12. This is an algorithm which searches for consecutive data items in three separate one dimensional arrays all of size n. You can assume all the arrays have 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) Draw a graph of the algorithm to illustrate and identify its order of time performance. Graph paper is not required. [4] 13. Discuss contemporary approaches to human-computer interaction. You should draw on your knowledge, skills and understanding from a number of areas across your computer science course when answering this question. [13] END OF PAPER Algorithm Search declare i as integer declare myArray1[n] as integer[] declare myArray2[n] as integer[] declare myArray3[n] as integer[] declare found as string set i = 0 set found = “” do if myArray1[i] = myArray1[i+1] then set found = found + myArray1[i] + “ “ end if if myArray2[i] = myArray2[i+1] then set found = found + myArray2[i] + “ “ end if if myArray3[i] = myArray3[i+1] then set found = found + myArray3[i] + “ “ end if set i = i + 1 while (i < n) output “Consecutive data items found: “ , found BLANK PAGE 6 © WJEC CBAC Ltd. (1500U30-1) 6 © WJEC CBAC Ltd. BLANK PAGE (1500U30-1) 7 © WJEC CBAC Ltd.