3. (40 points) as we discussed in class, stable sorting algorithms maintain the relative order of records with equal values. that is, a sorting algorithm is stable if whenever there are two records r and s with the same key and with r appearing before s in the original list, r will appear before s in the sorted list as well. give a simple scheme to make any comparison-based sorting algorithm stable. how much extra memory will your scheme need?

Explain the difference laminar and turbulent flow. explain it with the shear stress and the velocity profiles.

Two flowing streams of argon gas are adiabatically mixed to form a single flow/stream. one stream is 1.5 kg/s at 400 kpa and 200 c while the second stream is 2kg/s at 500 kpa and 100 ? . it is stated that the exit state of the mixed single flow of argon gas is 150 c and 300 kpa. assuming there is no work output or input during the mixing process, does this process violate either the first or the second law or both? explain and state all your assumptions.

Condition monitoring is a major component of. (clo4) a)- predictive maintenance. b)-preventive maintenance c)-proactive maintenance d)-reactive maintenance.