What is the shortest hamilton path for the vertex-edge graph?

a to b to c to d
d to a to b to c
c to a to d to c to b
b to c to a to d

a and c

step-by-step explanation:

answer: first option i.e. 'a' is correct.

step-by-step explanation:

since we have given that

number of minutes to wrap a small gift box = 4 minutes

we need to find the number of gifts to be wrapped in 5 minutes

since there is a direct variation, as the number of minutes will increase with   number of gifts to be wrapped.

so, let the number of gifts to be wrapped in 5 minutes be x.

so, it becomes,

hence, first option 'a'   is correct.

3

step-by-step explanation:

because where the point where the 2 lines intersect is (3,-1) the x value is 3