which of the following is not true each time node is splita exactly one new node is created exactly one new data item is added to the tree one data item moves from the split node to its parent one data item moves from the split node to its new sibling tree increases its number of levels when searching tree does not involve splitting nodes on the way down if necessary picking the appropriate child to go tobased on data items in node ending up at leaf node if the search key is not found examining at least one data item in any node visited after non-root node of tree is splitdoes its new right child contain the item previously numbered or -node split in tree is equivalent to in red-black tree which of the following statements about node-splitting operation in - tree (not treeis not truea the parent of split node must also be split if it is full the smallest item in the node being split always stays in that node when the parent is splitchild must always be disconnected from its old parent and connected to the new parent the splitting process starts at leaf and works upward what is the big efficiency of - tree in accessing data on disk drivea inserting data is slow but finding the place to write data is fast moving data to make room for more data is fast because so many items can be accessed at once deleting data is unusually fast finding the place to write data is comparatively slow but lot of data can be written quickly in -tree each node contains data items