Finding the Mth Prime Number Write a well-documented Python program, hmwk3Q1.py that finds the Mth prime number by extending hmwk2Q3.py, which finds the prime number for a single number. Have your program query the user for the integer M. Print the value of the 908th prime number and record it as a comment in your Python program. Hints: Re-use hmwk2Q3.py software by embedding it in a while-loop. The while-loop continues to call upon the prime number code until it finds the 908th prime number. Make sure that inside the while-loop you implement a counter, which is incremented when a prime number is found.

  1) Below is python program to find Nth prime number

• It display's the message to user for prime checking
• Ask user to enter an integer using input function, convert it to integer and assign it to num variable
• Initialize number and prime count
• Run loop to continue call upon prime numbers
  
  • Initialize an empty list to store the factors
  • Loop through integers from 2 to number
    • Check if i is a factor of count
      • append the factor with prime number
  • If length of factors is 0, means it is a prime number
    • increase prime count
  • If prime count the user selected number, display prime and break from while loop
  • increment number to check for next prime

2) Save program in python file hmwk2Q3.py and run