Using your favorite implementation of regular expressions (Python, grep, sed,..), input your regex from The attached documents and test to see how many strings from the set of all strings over the alphabet {a,b} of length at most 5, i.e., (''', a, b, ab, .., bbbbb} are described by (1.C., match) each of your input regexes. Note: that you will have to match the *entire* string with the regex, so watch out for this implementation detail. How many strings (you can just give the count) are matched with the attached document

In a C program; I think the last part is whats corrupting my code. IF you could explain evrything but with emphasis on that a bit more. Thanks   Implement the following algorithm as the find_gcd( ). This function will find thegreatest common divisor (that is, the product of all common factors) of integers n1and n2 . Input parameters: n1 and n2. Output parameter: p.Algorithm:Put the absolute value of n1 in q and of n2 in p .Store the remainder of q divided by p in r .while r is not zeroCopy p into q and r into p .Store the remainder of q divided by p in r .p is the gcd .

Write a program in js to add key value pair in an object and print that Note that you must use dot notation

Write the code in python to define the function has_adjacent_repeats(mystr), which takes a string parameter and returns a boolean result.   - If mystr has at least one instance of adjacent characters being equal, return True   - Otherwise, return False Hint: You can iterate over the positive indices i for characters in mystr: 1, 2, 3, ...., len(mystr)-1 with a for loop. For each i, if the character at index i matches the character at index i - 1, return True. Otherwise, if no doubled character is found in the entire string, return False. For example: Test Result if not (has_adjacent_repeats("NOODLES") is True): print("error")   if not (has_adjacent_repeats("Bananas") is False): print("shwoopsie")   if not (has_adjacent_repeats("Hanoverr") is True): print("error")

Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False.   Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates.  Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following.  aaa has duplicatesabc has no duplicates  Print a line like one of the above for each of the strings in test_dups.    test_dups = ["zzz","dog","bookkeeper","subdermatoglyphic","subdermatoglyphics"]

Write programs to find the sum of elements of an array of n numbers in both Python and Java. Which of the two programs has higher degree of readability and why?

Q1. Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b):    """Finds if `str_a` matches `str_b`     Keyword arguments:    str_a -- string    str_b -- string    """    len_a, len_b = len(str_a) + 1, len(str_b) + 1    matches = [[False] * len_b  for _ in range(len_a)]     # Match empty string with empty pattern    matches[0][0] = True     # Match empty string with .*    for i, element in enumerate(str_b[1:], 2):        matches[0][i] = matches[0][i - 2] and element == '*'     for i, char_a in enumerate(str_a, 1):…

Please help me fill in the blanks   The reverse of a string x, denoted rev(x), is the string obtained by writing x backwards. For example, if x = abbaaab then rev(x) = baaabba. If A is a subset of Σ*, the reverse of A, denoted rev(A), is the subset of Σ* consisting of all reverses of strings in A: rev(A)={rev(x) | x∈A} For example, rev({a,ab,aab}) = {a,ba,baa}. Suppose you are given a deterministic finite automaton M accepting a set A. Show how to construct a DFA N accepting rev(A). (Kozen would suggest putting pebbles on the final states of M and moving them backwards along transition edges.) Describe N formally (i.e. in terms of Q, δ, etc.) including the definition of acceptance. Hint: the subset construction will be helpful here. You can start with M = (Q, Σ, δ, s, F) and define the components of N in terms of the components of M. 1. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​) where Q_N​ = ___ 2. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​) where δ_N​ = ___ 3. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​)…