1. Given two sorted lists of size M and N find the median of all elements in O (log (m +n)) time. 2. Give a sorted array A of N elements, possibly with duplicates, find the index of the first...

1. Given two sorted lists of size M and N find the median of all elements in O (log (m +n)) time.

2. Give a sorted array A of N elements, possibly with duplicates, find the index of the first occurrence of a number in O (log n) & time.

Give a sorted array A of N elements, possibly with duplicates, find the index of the last occurrence of a number in O (log n) & time.