1 Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity. Try it for binary tree. What is hashing. What is constant time complexity? Which are the data structures which have constant time complexity. HINT - they both use indexes? The preprocessor method will use what data structures to ensure the getA() or getB() function will determine the 3rd B's position in constant time complexity