Q3 Which of the following are correct?(i) Every rooted tree of height h has at least 2 nodes.(ii) Every rooted tree of height h has

Q3 Which of the following are correct?(i) Every rooted tree of height h has at least 2¹ nodes.(ii) Every rooted tree of height h has at most 2" nodes.(iii) Every tree can be rooted so that it has height at most [(n-1)/2].(iv) If u, v are leaves of equal depth d in a rooted tree, then the length of the unique u-v-path(v0=u, V?...,vi=v) is odd.