Problem 2 The word -boundary character class # ` matches the beginning and end of a word : In [ ] : Str _ view_ all ! These are some...

Could you give me the answers for problem 2, 3, 4 Using R programming? The W ish letter is a back space sign() in case you might be confused

Problem 2The word -boundary character class # ` matches the beginning and end of a word :"In [ ] : Str _ view_ all !" These are some words . " , " #^" }Use this character class to write a regular expression rez such that at r_ count !'s , rez ; counts the number of words in the string { . Here a word isdefined a consecutive string of letters or apostrophes .|1 [ ] : # YOUR CODE HEREStop! !In [ ] : Stopi f not [ exists !" red " ! !Problem 3Write a regular expression which matches any word containing exactly two vowels . Store this regular expression in a variable named res . " Word " is defined*as in problem 2 .|1 [ ] :`# YOUR CODE HEREStop! !In [ ] : Stopi f not ! exists !" re? " ;]Problem 4For this problem , we define a proper noun as one or more capitalized words , optionally separated by the word ( s ) " and " , " of " , " the " , and/ or " by " . Write aregular expression which matches proper nouns . Store your expression in a variable called re4 . ( If a capitalized word occurs at the beginning of asentence , you may assume it is part of a proper noun . )Problem 2The word -boundary character class # ` matches the beginning and end of a word :"In [ ] : Str _ view_ all !" These are some words . " , " #^" }Use this character class to write a regular expression rez such that at r_ count !'s , rez ; counts the number of words in the string { . Here a word isdefined a consecutive string of letters or apostrophes .|1 [ ] : # YOUR CODE HEREStop! !In [ ] : Stopi f not [ exists !" red " ! !Problem 3Write a regular expression which matches any word containing exactly two vowels . Store this regular expression in a variable named res . " Word " is defined*as in problem 2 .|1 [ ] :`# YOUR CODE HEREStop! !In [ ] : Stopi f not ! exists !" re? " ;]Problem 4For this problem , we define a proper noun as one or more capitalized words , optionally separated by the word ( s ) " and " , " of " , " the " , and/ or " by " . Write aregular expression which matches proper nouns . Store your expression in a variable called re4 . ( If a capitalized word occurs at the beginning of asentence , you may assume it is part of a proper noun . )