Write a regular expression for each of the following sets of binary strings. Use only the basic operations. all binary strings except empty string begins with 1 and ends with a 1 ends with 00 contains at least three 1s

Given string inputString on one line and integers idx1 and idx2 on a second line, output "Match found" if the character at index idx1 of inputString is equal to the character at index idx2. Otherwise, output "Match not found". End with a newline. Ex: If the input is: banana 1 3 then the output is: Match found Note: Assume the length of string inputString is greater than or equal to both idx1 and idx2. import java.util.Scanner; public class CharMatch {   public static void main(String[] args) {      Scanner scnr = new Scanner(System.in);      String inputString;        int idx1;        int idx2;       inputString = scnr.nextLine();        idx1 = scnr.nextInt();        idx2 = scnr.nextInt();            /* Your code goes here */     }}

Write a regular expression for each of the following sets of binary strings. Use only the basic operations. contains the substring 110 doesn't contain the substring 110 whose tenth symbol from the right is 1 not containing 101 as a substring

Write a C program that does the following tasks using while loop: • Reads 7 integers. • Finds the sum of numbers that are divisible only by 5.