The method primeNumber takes an integer k 0 and returns true if k is a prime number. For example, System.out.println(primeNumber(13)); will print true and System.out. println(primeNumber (9)); will...

The method primeNumber takes an integer k 0 and returns true if k is a prime number. For example, System.out.println(primeNumber(13)); will print true and System.out. println(primeNumber (9)); will print false. A prime number is an integer k 2 that is divisible only by 1 and itself. The first few prime numbers are: 2, 3, 5, 7, 11, 13, .... Based on the 2 black box testing techniques boundary value analysis and equivalence class, write a test plan to test the method primeNumber.