Explanation: I really dont even know, I just used up all my tries on it and got it wrong on every other thing i chose. So it's 35 i believe cause its the only answer i didnt choose.

7 0

3 years ago

Consider a Carnot refrigeration cycle executed in a closed system in the saturated liquid–vapor mixture region using 1.06 kg of

Alexxandr [17]

Answer:

$P_m_i_n = 442KPA$

Explanation:

We are given:

m = 1.06Kg

$T_H = 1.2T_L$

T = 22kj

Therefore we need to find coefficient performance or the cycle

$COP_R = \frac {1}{(T_R/T_l) -1}$

$= \frac {1 }{1.2-1}$

= 5

For the amount of heat absorbed:

$Q_l = COP_R Wm$

= 5 × 22 = 110KJ

For the amount of heat rejected:

$Q_H = Q_L + W_m$

= 110 + 22 = 132KJ

[tex[ q_H = \frac{Q_L}{m} [/tex];

= $= \frac{132}{1.06}$

= 124.5KJ

Using refrigerant table at hfg = 124.5KJ/Kg we have 69.5°c

Convert 69.5°c to K we have 342.5K

To find the minimum temperature:

$T_L = \frac{T_H}{1.2}$ ;

$T_L = \frac{342.5}{1.2}$

= 285.4K

Convert to °C we have 12.4°C

From the refrigerant R -134a table at $T_L$ = 12.4°c we have 442KPa

6 0

3 years ago

A group of n Ghostbusters is battling n ghosts. Each Ghostbuster carries a proton pack, which shoots a stream at a ghost, eradic

babunello [35]

Answer:

Using the above algorithm matches one pair of Ghostbuster and Ghost. On each side of the line formed by the pairing, the number of Ghostbusters and Ghosts are the same, so use the algorithm recursively on each side of the line to find pairings. The worst case is when, after each iteration, one side of the line contains no Ghostbusters or Ghosts. Then, we need n/2 total iterations to find pairings, giving us an P( $n^{2} lg n$ )- time algorithm.

4 0

3 years ago