Consider the following code snippet: int a = 1; while (a < n) { a = a * 2: What is the complexity of the above code snippet? What is the average time complexity of finding an element in a binary search tree with n elements?

A financial firm manages a variety of assets for clients, including bonds and stocks. They wish to consolidate the maturity dates of bonds and dividend payment dates of stocks to provide an overview of upcoming financial events for their clients. The required statistic is a unified list that displays both bond maturity dates and stock dividend payment dates. The result should have the following columns: client name | asset name | event type / event date. • client name - name of the client. asset name - name of the bond or stock. • event type - type of the event ("Bond Maturity" or "Stock Dividend Payment"). • event date - the date of the bond maturity or stock dividend payment. The result should be sorted in ascending order by event date.