Given R = 1∗0 +1 +0 +1Σ∗ and S = (1+0 ∗ ) ∗1 where Σ = {0, 1} Design a regular expression that accepts the language of all binary strings with no occurrences of 1001

strcmp compares the strings s1 and s2, returning a value. What are the possible values that it can return?

Computer Science Q2.Write a java program to implement the concept of Horspool string matching algorithm to find the pattern in the Text Text STRING MATCHING Pattern : ING Java code i want solved very quickly