hello i need only response to those questions without explanation , it's my 4 times that I submit this question , please i don't need explanation ,i need only answers only answers to fill this table

10. What kind of tree has the property that the nodes along the path from the root to any node are in sorted orde 0 A. binary search tree B.complete binary tree D. None of the above C.heap 11. To sort {8.3,9,11,2, 1,4,7,5,10,6 } by Shell Sort, if we obtain (4, 2, 1,8,3, 5, 10,6,9,11,7), then th increment of this run is ()? A. 1 B.2 C.3 D. 5 12. In a directed graph the relation between the sums ofin-degrees Sin and out-degrees Sout of all the vertices i (..? A. Sin=Sout B. Sin >=Sout C. Sin Sout D. cannot be detemined 13. Among the algorithms that sort by comparisons only, which method has its worst-case time complexi bounded above by O(NlogN)?: ( ) A. merge sort B. bubble sort C. quick sort D. shell sort 14. If a stack is used instead of a queue for the topological sort algorithm, does a different ordering result?: A. Yes, always. B. No, never. C. Yes, sometimes. D. None of the above. 15. To represent a graph with N vertices by the adjacency matrix, the size of the matrix must be? A. N-1 B. N C. (N-1)^2 D. N^2 16. Among the following problems, _ is NOT an NP-complete problem.? A. Vertex cover problem B. Hamiltonian cycle problem C. Satisfiability problem D. Halting problem 10 11 12 13 14 15 16