A software organization has a reusable code library that contains implementations of four different algorithms that each perform the same basic function. These algorithms operate on variable size linked lists containing anywhere from 0 to 100 entries. Through experimentation it was determined that the performance of each routine is as listed in the following table.

| Algorithm | Initialization Time| Time per Item in Input List |

| A | 34 | 0.52 |

| B | 55 | 0.24 |

| C | 48 | 1.06 |

| D | 21 | 1.75 |

1. Identify the break-even points between each pair of routines.

2. Identify the range of input list size over which each routine has superior performance. Caution, one or more of the routines may be poor performers over all ranges of inputs.