For an array containing 2, 3, 5, 6, 9, 13, 16, and 19, what value does a recursive binary search algorithm return when it searches for 6?

Answer the following questions true (T) or false (F)

1. True/False: A double precision number always takes up 64 bits in the computer’s memory. 2. True/False: The following two representations are equivalent: 1110010111010101010100112 and D5D55316 3. True/False: It is impossible to store 1610 in 4-bits because overflow will occur.

A spanning tree of a graph is a tree with that always has which of the following properties?

a) It includes some of the edges and some of the vertices of the graph. b) It includes all of the edges and some of the vertices of the graph. c) It includes some of the edges and all of the vertices of the graph. d) It includes all of the edges and all of the vertices of the graph. e) none of the above