Jeff loves to develop code for random scenarios. Today Jeff started playing with a couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B with random numbers. Jeff...

Extracted text: Jeff loves to develop code for random scenarios. Today Jeff started playing with a couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B with random numbers. Jeff visits each index i (1 <= i=""><= n)="" in="" random="" order.="" when="" at="" i,="" he="" selects="" another="" random="" indexj="" such="" that="" j="" is="" greater="" or="" equal="" to="" i.="" he="" then="" increments="" a[i],="" a[i+1],="" a[i+2]="" ...="" alj]="" by="" 1.="" finally,="" if="" for="" any="" index="" i,="" a[i]="" is="" greater="" than="" b[1],="" he="" then="" throws="" away="" that="" array="" a.="" for="" a="" given="" b,="" calculate="" the="" number="" of="" different="" arrays="" a,="" that="" jeff="" can="" end="" up="" with.="" two="" arrays="" are="" called="" different="" if="" there="" exists="" an="" index="" where="" the="" arrays="" have="" different="" values.="" help="" jeff="" in="" creating="" a="" c++="" code="" that="" prints="" a="" single="" line="" containing="" the="" required="" answer="" modulo="" 109="" +="" 7.="" sample="" test="" case:="" 1="" 111="" result:="">