In the AVL tree, a deletion may require multiple rotations. Select one: True False To heapsort data in ascending order without an extra array, a min heap should be built first. Select one: True False When DFS is used to find Euler Circuit, a vertex can be visited only once. Select one: True False In Insertion Sort, swapping two adjacent elements can only removes one inversion. Select one: True False A collision occurs when two nonidentical identifiers are hashed into the same bucket. Select one: True False