Suppose that you want to simulate the life cycle of a binary search tree as described on slides 45-48 of the trees lecture slides (cis 256 and cis 279 class notes)preview the document and in section 4.3.5. (average-case analysis) of the textbook by mark allen weisspreview the document. considering the problems that can be caused by random insert/remove pairs, here is a strategy that is not perfectly random, but close enough: initial setup: build a tree with n elements by inserting n elements chosen at random from the range 1 to m , where m is an integral multiple of n, i. e. m = k*n (where k is an integer independent of n).

Steam at a pressure of 100 kpa and a quality of 50% initially fills a rigid vessel having a volume of 0.5 m^3. the steam is then heated, causing the pressure in the vessel to rise to 150 kpa. determine: i. the mass of the steam in the vessel. ii. the temperature and quality of the steam after the heating process. ii the mass of the vapour, mg and liquid, m in the vessel after the heating process. if the steam in the vessel is now further heated, what would the pressure and temperature in the vessel be when all steam has turned into saturated vapour? b. sketch the processes in part (a) and part (b) on p-v and t-v diagrams, indicating clearly the temperatures, pressures and the paths. c. (0.59kg, 111.4°c, 73%, 0.4307kg, 0.1 593kg, 2.11 bar, 121.84°c)