Answer:
Correct option: third one -> 12
Step-by-step explanation:
In a polygon with 'n' vertex, we can trace diagonals from one vertex to all vertices, except to the vertex chosen and the two adjacent vertices (because we would have sides and not diagonals), so we would have 'n - 3' diagonals.
If we have a polygon with 15 vertex, the number of diagonals from one vertex is 15 - 3 = 12.
Correct option: third one
I think it’s going to be B.
60.44 is greater than 60.3
-you can see this when you subtract 60.3 from 60.44 this would leave a 0.11 which is a positive number.
-thus meaning 60.44 is larger/greater.
The minimal completion time for the activities is the shortest possible time for all the activities to be finished. In doing this, we look at the path that would require the greatest amount of time. At the START node, we choose the path that would take the longest which is 7 days leading to ACTIVITY D. Next, we choose the path leading to ACTIVITY B which takes 5 days. Then, we move to ACTIVITY C taking 5 days and finally, reach the END which would take 6 days. So, the minimal completion time is:
7 + 5 + 5 + 6 = 23 days
