For the fake coin problem

1. write a BF algorithm and find the time complexity

2. write D & C algorithm and find the time complexity

3. write Dec & C algorithm and find the time complexity

Write D & C algorithm to search about an item X in array of size n

Write the recurrence equation of the algorithm and find the time complexity

The sort technique that hasn't a best case is

a. insertion sort

b. quick sort

c. bubble sort

d. merge sort