input: Write a function to generate n-grams of the given text with a specific window size. The function should accept the text and the window_size as parameters and return a Counter object containing the n-grams and their counts. If the window size is greater than the length of the text, the function should return an empty Counter.
  
  from collections import Counter
  
  def generate_ngrams(text, window_size):
      text = text.lower().split(' ')
      ngrams = []
      if window_size > len(text):
          return Counter()
      for n in range(window_size, len(text)+1):
          for i in range(len(text)-n+1):
              ngrams.append(' '.join(text[i:i+n]))
      return Counter(ngrams)
  
  assert generate_ngrams("The quick brown fox jumps over the lazy dog", 3) == Counter({'the quick brown': 1, 'quick brown fox': 1, 'brown fox jumps': 1, 'fox jumps over': 1, 'jumps over the': 1, 'over the lazy': 1, 'the lazy dog': 1})
  assert generate_ngrams("The quick brown fox", 4) == Counter({'the quick brown fox': 1})
  assert generate_ngrams("The quick brown", 5) == Counter()
  assert generate_ngrams("", 3) == Counter()
  assert generate_ngrams("The quick brown fox jumps over the lazy dog", 1) == Counter({'the': 2, 'quick': 1, 'brown': 1, 'fox': 1, 'jumps': 1, 'over': 1, 'lazy': 1, 'dog': 1})
output: 
  def generate_ngrams(text, window_size):
      text = text.lower().split(' ')
      ngrams = []
      if window_size > len(text):
          return Counter()
      for n in range(window_size, len(text)+1):
          for i in range(len(text)-n+1):
              ngrams.append(' '.join(text[i:i+n]))
      return Counter(ngrams)
  