Please answer these two questions I will give thumbs up.

Question 6

Write a function or a predicate in a programming language of your choice that takes a string and checks if the string matches the pattern {0^n1^m2^k | k=n+m} .

Question 3

Give a CFG for each of the following languages over = {0,1,2}.

1. Strings that have the pattern {0^n1^m2^k | k=n+m} .

2. Decimal integers that are multiples of 3. Hint: a decimal integer is a multiple of 3 if the sum of the digit values is a multiple of 3.

Question 6 Write a function or a predicate in a programming language of your choice that takes a string and checks if the string matches the pattern {0n1m2kk=n+m}. Give a CFG for each of the following languages over ={0,1,2}. 1. Strings that have the pattern {0n1m2kk=n+m}. 2. (extra 5 points) Decimal integers that are multiples of 3 . Hint: a decimal integen in as multiple of 3 if the sum of the digit values is a multiple of 3