True or False T F $($i$)$ Like Divide and conquer, Dynamic Programming solves problem by conquer independent sub$-$ problems. T F $($j$)$ In dynamic programming, we usually reduce time by increasing the amount of space. T F $($k$)$ Linear probing is equivalent to double hashing with a secondary hash function of h$2($k$)=1.$ T F $($l$)$ The depths of any two leaves in a heap differ by at most $1.$ T F $($m$)$ log$($logn$)$ in O$($n$/$logn$)$ T F $($n$)$ An algorithm$$s time efficiency indicates how fast the algorithm runs. It is principally measured asa function of its input parameters and basic operations T F $($o$)$ Distribution counting sort is a linear sorting algorithm with constant space efficiency.