The binary search algorithm searches for a value in an array by splitting the array in half and then recursing on one of the halves, based on the result of the comparison with the middle element. In class we saw that the worst case running time is (log n). Now consider the same algorithm but with a split into 10% and 90%. How would that a ect its asymptotic worst-case running time

Jason is working on a microsoft excel worksheet and he wants to create a print preview shortcut. his teacher asks him to access the customization option to create the new shortcut. which two tabs should jason select to place the print preview shortcut on the worksheet toolbar? a. new tab (custom) and new group (custom) b. new file tab (custom) and new tab (custom) c. new custom group and new command d. new custom tab and new command