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

f(x) = y

f(-3) = -5

step-by-step explanation:

1260=3*6*7*10=3^2*2^2*7*5 perfect cude = 3^3*2^

step-by-step explanation:

my name jeff

step-by-step explanation:

natural disasters at one point james charles' career

step-by-step explanation:

i'm not sure how to show the work for this

answer : c and d or 4(29 + 6)

4(29) + 4(6)