/** Functions for lab 07. CS100J */
public class Lab07 {
    
    /** = ³p is a prime.² i.e. is at least 2
     and is divisible by only 1 and itself */
    public static boolean isPrime(int p) {
        if (p < 2)
            return false/*change the expression */;
        
        if (p == 2)
            return false/*change this expression */;
        
        int k= 0/*change this expression */;
        // inv: p is not divisible by integers in 2..k-1
        while (k != p) {
            if ( false /*change this expression */ )
                return false;
            k= k+1;
        }
        
        return false/*change this expression */;
    }
    
    /** = a String that contains each capital letter (in
     'A'..'Z') whose representation is prime */
    public static String primeChars() {
        String s= "";
        char c= 'Z'/*Change this expression*/;
        
        // inv: s contains each capital that is less than c and whose
        // representation is prime
        while ( c==c/*change this expression */ ) {
            if ( false/*change this expression */ )
                s= s + ""/*change this expression */;
            c= (char)(c+1);
        }
        
        return s;
    }
    
    /** = number of times character c appears in String s */
    public static int noOfTimes(char c, String s) {
        return 0;
    }
    
    /** = number of times the characters in s1 appear in s2 
          e.g. noOfTimes("aeiou", st)
               gives the number of vowels in string st
          e.g. noOfTimes("aaa", "ac") is 3*/
    public static int noOfTimes(String s1, String s2) {
        return 0;
    }
    
    
}