|Question 1 UGC NET June-2020 |
Let) G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j=i+1 or j=3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is _.
|A – 23|
|B – 99|
|C – 4|
|D – 7|