6. Searching for Prime Numbers // Filename: primeSearch.m Write a program, called primeSearch.m, that ... Continues to generate a random integer from 1 to 100 until the random integer is prime (the program must keep track of how many integers it takes to find the prime number). Uses a loop to repeat the process listed above for 1000 trials in order to find the average number of integers that need to be generated to find a prime number. Displays the results to the Command Window as follows (your number will be different). The average number of random integers generated was 3.8590