Consider the network diagram below with distances between the nodes in kilometres. 2
15
5
4
4
4
10
8
3
4
5
13
2
6
8
5
6
3
5
5
15
4.
9
9
10
12
1.1 Use an algorithm to determine the shortest route from node 1 to node 10. Show all your
workings.
(11
1.2 What is the minimum distance between model and node 10?
12

22, 28, 34, 40, 46

b)   f(n) = 6n + 16

n = what is the number of the row ( 22 would be row 1) so if we replaced n with 1, we would get 22

c)   the 14th row will have 100 seats

(1)   (2)   (3)   (4)   (5)   (6)   (7)   (8)   (9)   (10) (11) (12) (13) (14)

22 | 28 | 34 | 40 | 46 | 52 | 58 | 64 | 70 | 76 | 82 | 88 | 94 | 100

hello,

as we don't know if g(x) is continue,

answer b

f(x)=2x²-8x+1=2(x²-4x+4)+1-8=2(x-2)²-7

vertex is (2,-7) ( a minimum since coefficient of x² is > 0)