Given string inputText, output "Match found" if the first character of inputText is 'w. Otherwise, output "Match not found". End with a newline. Ex: If the input is: warmth then the output is: Match found Note: Assume the length of string inputText is greater than or equal to 1. 1 import java.util.Scanner; 2 3 public class CharMatch { 4 5 6 7 8 9 10 11 12 13} public static void main(String[] args) { Scanner scnr = new Scanner(System.in); String inputText; inputText = scnr.nextLine()); /* Your code goes here */ } 2 0 3

7. Select primes p=1009, q=1013, And find the encrypted and decrypted key using RSA algorithm.

CS 386 Project: Overview Project Synopsis: This group project will require your group to design and implement your own enciphering algorithm. Your team's algorithm must combine the two operations, substitution and permutation/transposition, into your unique encryption algorithm. Your encryption algorithm must include multiple rounds of the two operations. You program must be able to encrypt and decrypt messages. Your team will need to give your algorithm a name that is unique to your encryption technique. Your group may

create a search statement on: The effect of the COVID-19 pandemic on higher education. Using Boolean operators