Write JavaScript function that will serve as a constructor for Rectangle object with two data properties width and length. Add method to the rectangle object that will compute and return the area of the rectangle. 2. Write Javascript function that will take as an input a string and check if that string contains letters a, b, c (disregarding case) in order but not necessarily adjacent. The function should return either true or false and needs to use regular expressions. here are some examples of strings that should return true: abc danmhblkoc aabbc adagbkbiuc abca And, here are some strings that should return false: dgk dakl cba abac.

You may assume the string contains only lowercase alphabets.Reference: https://leetcode.com/problems/valid-anagram/description/"""def is_anagram(s, t):    """    :type s: str    :type t: str    :rtype: bool    """    maps = {}    mapt = {}    for i in s:        maps[i] = maps.get(i, 0) + 1    for i in t:        mapt[i] = mapt.get(i, 0) + 1    return maps == mapt

Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "*". Sample I/O: Sentence: azoooza azooza zoo azoo Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: * Done