Problem 3 -

• Write a function called countNestedWord
• This function accepts two arguments which are both strings
• The first argument is a long string or phrase and the second is a substring
• This function should count the number of times the substring is nested within the first string argument (case insensitive)
• This function returns the number which is the count

Output Example:

countNestedWord(

'nodejavascriptnodevscodejsnodejavascriptvscodenopenonenode',

'node'

)

output: 4

countNestedWord(

'There are many differences between Java and JavaScript',

'java'

)

output: 2

THIS IS JAVASCRIPT