Match the following:Time ComplexityAnswer 1CompletenessAnswer 2Accuracy Answer 3Space ComplexityAnswer 4

nswer the following questions based on the given pseudocode.1. What will be the time complexity?2. What will be the space complexity?Pseudocode:Response:Question 10 Time taken: 4sQ.10OPTIONS RESPONSE ANSWER1. O(n+p)2. O(n)1. O(n^2)2. O(1)1. O(n+p)2. O(n^2)1. O(n)2. O(n)BEGININTEGER p=5QUEUE qSTACK sIF (Empty(q))RETURNFOR i IN 0 to p-1s.push(q.peek())q.remove()ENDFORWHILE !Empty(s):q.add(s.peek())s.pop()ENDWHILEFOR i IN 0 to SIZE(q)-1q.add(q.peek())q.remove()ENDFORPRINT (q)END12345678910111213141516171819202122

The search algorithm that gives an overall time complexity of O(log i) + O(log n) isGroup of answer choices

Match combining forms with their definitions. Answers may be used more than once.metr/o Answer 1mamm/o Answer 2salping/o Answer 3perine/o Answer 4oophor/o Answer 5men/o Answer 6hyster/o Answer 7mast/o Answer 8peri- Answer 9-cleisis Answer 10-salpinx Answer 11

Match the terms to their definitions (2 points - all or nothing)groundsAnswer 1 Question 26warrantsAnswer 2 Question 26judgementsAnswer 3 Question 26FactsAnswer 4 Question 26claimsAnswer 5 Question 26inferencesAnswer 6 Question 26

Question 1 (4 marks)A council is constructing a new playground. This project involves completing tasks A to H. The varioustasks and their prerequisites are shown in the precedence table below.Task Time (weeks) Prerequisites Earliest start time Latest start timeA 2 None 0 0B 1 None 0 3C 1 A 2 2D 5 A and B 2 4E 3 C 3 4F 2 C 3 3G 2 E 6 7H 4 F 5 5Use the information in the table above to answer parts (a) to (d).(a) State the task that takes the longest time to complete.(1 mark)(b) List all of the tasks that must be completed on time in order to cause no delay.(1 mark)(c) Calculate the minimum completion time for the construction of the playground.(1 mark)(d) If a network diagram were to be drawn for this project, which task would require a dummy linkleading into it? Tick the appropriate box to indicate your answer.Task A Task D Task E Task G (1 mark)