Consider the following ordered list of data, 'x' and a key = 41 NOTE: lo starts out at index 0 and hi at index 8 index TH 12 1 30 2 50 3 100 4 130 5 245 6 260 What is the first data item that binary search will compare against the key? 7 8 25 380 413 Assuming mid= floor( (lo+hi)/2 ). How many comparisons between key and data item will binary search perform before failing to find the key in the list? 00 Food, S