( )-time algorithm runs fasterand only when > is the ( log -time one better explain how this is possible creativity - describe recursive algorithm to compute the integer part of the base-two logarithm of using only addition and integer division - describe how to implement the queue adt using two stacks what is the running time of the enqueue(and dequeue(methods in this casec- suppose you are given an -element array containing distinct integers that are listed in increasing order given number kdescribe recursive algorithm to find two integers in that sum to kif such pair exists what is the running time of your algorithmc- given an -element unsorted array of integers and an integer kdescribe recursive algorithm for rearranging the elements in so that all elements less than or equal to come before any elements larger than what is the running time of your algorithmc- show that is ( - show that geometric progression (hinttry to bound this sum term by term with - show that log (nis th(logf( )if is constant -