Which of the following is one of the cheapest routes to pass through each vertex once starting and ending with
Vertex "A" and using the Nearest Neighbor Algorithm.
$200
OCS
$230
$240
$310
ABCDA. $960
ACDBA. $900
ACBDA. $960
None of the Above

240$

Step-by-step explanation:

$200

OCS

$230

$240

$310

ABCDA. $960

ACDBA. $900

ACBDA. $960 =240

its kind of blurry. can you put a clearer pic?

step-by-step explanation:

85.560%

step-by-step explanation:

conditional probability is defined as:

p(a|b) = p(a∩b) / p(b)

in other words, the probability that a occurs, given that b has occurred = the probability that both a and b occur / the probability that b occurs.

in this example:

p(turns 64 | turns 44) = p(turns 64 & turns 44) / p(turns 44).

if someone turns 64, they must have already turned 44, so:

p(turns 64 | turns 44) = p(turns 64) / p(turns 44)

on page 42, we see that of the original 100,000, 94944 turn 44, and 81234 turn 64.   therefore:

p(turns 64 | turns 44) = 81234 / 94944

p(turns 64 | turns 44) = 0.85560