below is flowchart for the program and pseudocode

#include int main () { int a[100],n; int item, i,flag; printf(" Enter size of array "); scanf("%d",&n); printf(" Enter elements into array "); for(i=0;i 
 
 
b) Pseudocode:
 
LINEAR_SEARCH(A, N, VAL) Step 1: [INITIALIZE] SET POS = -1 Step 2: [INITIALIZE] SET I = 1 Step 3: Repeat Step 4 while I 
 
  Write the algorithm for a linear search (non-recursive) program. The program reads an integer and loops through an array to find it. Assume the array has already been populated with random numbers and they are not sorted. If the integer is found, the program outputs the index position of where the integer exists in the array. If the integer is not found, the program prints the message Integer not found. Create a Nassi-Shneiderman diagram for the program. Start Read Item i = 1 loc = 0 F While i