This question concerns the dynamic programming algorithm for computing a binary tree, discussed in class in and in the notes. Suppose we are given the following data, consisting of 8 key values and the frequency with which each key is accessed: i Data pi
1 A 0.09
2 B 0.17
3 C 0.26
4 D 0.05
5 E 0.06
6 F 0.12
7 G 0.1
8 H 0.15

Required:
a. For each i and j in the appropriate range, give the values of E[i, j] and root[i, j].
b. Draw the optimal binary tree for the data given above.
c. What is the weighted lookup cost of the optimal binary tree? Explain briefly how you computed it.

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it

For a typical middle-income family, what is the estimated cost of raising a child to the age of 18? $145,500 $245,340 $304,340 $455,500

Install and use wireshark program ( send back screen shots and other vital information) case project 3-2: decode a tcp segment in a wireshark capture in this chapter, you walked through tcp segment to interpret the data included in its header. in this project, you use wireshark to capture your own http messafes, examine the tcp headers, and practice interpreting the data you'll find there. 1. open wireshark and snap the window to one side of your screen. open a browser and snap that window to the other side of your screen so you can see both windows.