Consider this question from our textbook: Given an element x in an n-node order-statistic tree T (in other words, a red-black tree with size maintained in nodes as attributes) and a natural number i, how can we determine the ith successor of x (in other words, the ith node to visit after x in an inorder tree walk of T) in O(lgn) time? a) A student found a solution online for this question (https://courses.cs.duke.edu/cps130/summer02/Homeworks/Solutions/H13-solution.pdf ): "The ith successor of x is given by OS-SELECT (x, OS-RANK (T,x)+i), which will run in O(lgn) time." What error will we have if we implement using this algorithm? b) The student found another solution online for the same question (https://walkccc.me/CLRS/Chap14/14.1/): "The desired result is OS-SELECT (T, OS-RANK (T,x)+i). This has runtime O(h), which by the properties of red-black trees, is O(lgn)." What error will we have if we implement using this algorithm