Create a new linearFind method in the Searcher class that works on any object of the type Comparable and takes a List of Comparable objects.

What will be an ideal response?

```
/? ?
? Implement a l i n e a r s e a r c h t h r o u g h t h e l i s t o f
? comparable o b j e c t s
? @param t a r g e t t h e o b j e c t you a r e l o o k i n g f o r
? @param l i s t t h e l i s t o f c o m p a r a b l e o b j e c t s t o l o o k i n
? ?/
public s t a t i c Comparable l i n e a r F i n d ( Comparable t a r g e t ,
L i s t l i s t )
{
f o r ( i n t i n d e x =0; i n d e x < l i s t . s i z e ( ) ; i n d e x++)
{
i f ( t a r g e t . compareTo ( l i s t . g e t ( i n d e x ) ) == 0 )
{ return ( ”Found i t ! ” ) ; }
}
return ( ”Not found ” ) ;
}
```