## Question 1
What is the minimum time it takes for all the `n` nodes to receive the signal?

times = [[3, 1, 1], [2, 3, 1], [2, 4, 1]]  
n = 4  
k = 2
### Options

1. 1
Incorrect

----------------------------

2. 2
Correct
Going from node 2 to nodes 3 and 4 takes 1 time unit, but going from 2 to 1 takes 2 units since there's no direct path. The signal must first travel from 2 to 3, then from 3 to 1.
----------------------------

3. 3
Incorrect

----------------------------

4. -1
Incorrect

----------------------------

---------------------------------------------

## Question 2
What is the minimum time it takes for all the `n` nodes to receive the signal?

times = [[2, 1, 1], [1, 3, 1], [3, 4, 2], [5, 4, 2]]  
n = 5  
k = 1
### Options

1. 1
Incorrect

----------------------------

2. 2
Incorrect

----------------------------

3. 3
Incorrect

----------------------------

4. -1
Correct
No path exists between node 1 to nodes 2 and 5.
----------------------------

---------------------------------------------

## Question 3
What is the minimum time it takes for all the `n` nodes to receive the signal?

times = [[1, 2, 1], [2, 3, 1], [3, 4, 1]]   
n = 4  
k = 1
### Options

1. 1
Incorrect

----------------------------

2. 2
Incorrect

----------------------------

3. 3
Correct
Going from node 1 to node 2, node 2 to node 3, and node 3 to node 4 takes 1 time unit. Therefore, the total minimum time required will be 3.
----------------------------

4. -1
Incorrect

----------------------------

---------------------------------------------