Write the step$-$by$-$step process for the following tasks. No programming required. The steps must

be very clear and unambiguous such that it can be understood and carried out by an elementary

school child.

$$ Searching

Describe the algorithm you use for looking up a person$$s telephone number in the phone book.

The input is person$$s name; the output is the corresponding phone number. No program required.

$$ Selection

Describe an algorithm that takes two inputs: a list of n numbers and an integer m $($m $<=$ n$),$ and

returns the nth smallest element in the list. No program required. For example, suppose you have

list of income for $1000($n $=1000)$ people. You want to make a list of $100$ people with the highest

$($m $=100)$ income.