13-In the assignment job problem we search about the maximum cost

Select one: True False

14-We choose the approximation solution of any algorithm because it's easy to derive

Select one: True False

15-Let Array a= { 6,1,10, 9, 7, 4, 8, 2, 15 }; After applying quick sort the array after the first iteration is

a. a= {4, 1, 2, 6, 7, 9, 8, 10, 15}

b. a= { 1, 9, 6, 4, 7, 10, 8, 2, 15 }

c. a= {4, 1, 2, 10, 7, 9, 8, 6, 15}

d. a= {6, 1, 2, 4, 7, 9, 8, 10, 15}

16-The graph can

Select one:

a. haven't empty set of edges

b. have empty set of edges

c. have non-empty set of nodes and edges

d. have empty set of nodes