9) Determine the cost and structure of an optimal binary search tree for a set of n = 7 keys with the following probabilities: i 0 1 2 3 4 5 6 7 Pi 0.04 0.06 0.08 0.02 0.10 0.12 0.14 qi 0.06 0.06 0.06 0.06 0.05 0.05 0.05 0.05

Answer the given question with a proper explanation and step-by-step solution. Question 1 What is the worst time complexity for inserting an arbitrary item into a AVL tree? 0(n) 0 (log2 (n)) 0(1) 0(n^2) 0 (n log2 (n))   Question 2 What is the worst time complexity for inserting an arbitrary item into a binary search tree? 0(n) 0 (log2(n)) 0(1) 0 (n^2) 0 (n log2 (n))   Question 13 What is the time complexity for efficiently ordering elements (sorting) from a binary search tree? 0 (n) 0 (Log2 (n)) 0(1) 0(n^2) 0 (n log2 (n))   Question 11 The average Big O runtime to find an arbitrary element in an arbitrary AVL tree is roughly equal to the element in which other data structure or structures? Queue Hash Table Sorted Array LinkedList None of the above   Question 13 What is the time complexity for efficiently ordering elements (sorting) from a binary search tree? 0 (n) 0 (log2 (n)) 0(1) 0 (n^2) 0 (n log2 (n))   Question 23 What is the time complexity of the most time efficient algorithm for…

4. What path would algorithm A, using f(n) = g(n) + h2(n) heuristic as shown in the table above, return as a solution path for this search problem?

Construct the HMM  (Hidden Markov Model) for the following sequences