1 What is the Time Complexity of merge Sort?

a)logn b)n2 c)nlogn d)n 2:How many number of binary tree can be formed by 15 node? 3:How can you find the size of Virtual Memory? a)AdressBus b)DataBus c)Size of Ram d)size of HardDisk 4:How to increase the Processor Speed? a)By Increasing Ram b)Increasing Size of HardDisk c)Increase Virtual Memory d)All of the above Q5 Write the output of following: #include<iostream.h> int main() { float f=2.2; double d=2.2; if(f==d) cout<<"i like u"; else cout<<"i hate u";