Well, I think that maybe the answer is B or C. She shouldn't only look at her presentation while she is presenting it, that doesn't look professional, and you want to look at the people you are talking to.
Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
Answer:
Elastic IP address
Explanation:
Elastic IP addresses are static, persistent public IP addresses which can be associated and disassociated with the instance, as required.
This will provide the best failover solution that will keep same IP address on a new instance.
