1 Read the next sentence and determine True or False. (Correct: +2, No Answer : 0, Incorrect: -1) Complete binary tree is a full binary tree. The number of paths between any two vertices in a connected graph without cycles is only one. To search using hashing, you must compare the key value of the requested record with the key value of the stored record. When sorting n data with Merge sort, the execution time is always followed to O (nlogn).