1.(Project: Spam Scanner) Spam (or junk e-mail) costs U.S. organizations billions of dollars a year in spam-prevention software, equipment, network resources, bandwith, and lost productivity. Research online some of the most common spam e-mail messages and words, and check your own junk e-mail folder. Create a list of 30 words and phrases commonly found in spam messages. Write an application in which the user enters an e-mail message. Then, scan the message for each of the 30 keywords or phrases. For each occurrence of one of these within the message, add a point to the message’s “spam score.” Next, rate the likelihood that the message is spam, based on the number of points it received.

2.(Generic Linear Search Method) Write a generic method, Search, that implements the linear-
search algorithm. Method Search should compare the search key with each element in the array
until the search key is found or until the end of the array is reached. If the search key is found, return its location in the array; otherwise, return -1. Write a test application that inputs and searches an int array and a double array. Provide buttons that the user can click to randomly generate int and double values. Display the generated values in a TextBox, so the user knows what values they can search for [Hint: Use (T : IComparable< T >) in the where clause for method Search so that you can use method CompareTo to compare the search key to the elements in the array.]

(Generic Linear Search Method) Write a generic method, Search, that implements the linear-

search algorithm. Method Search should compare the search key with each element in the array

until the search key is found or until the end of the array is reached. If the search key is found, return

its location in the array; otherwise, return -1. Write a test application that inputs and searches an

int array and a double array. Provide buttons that the user can click to randomly generate int and

double values. Display the generated values in a TextBox, so the user knows what values they can

search for [Hint: Use (T : IComparable< T >) in the where clause for method Search so that you can

use method CompareTo to compare the search key to the elements in the array.]