Fix the alphabet ? = {0,1,2} for all strings. Let x,y be fixed strings. Let Lrzy be the language of all strings w such that the number of occurrences of x in w is the same as that of y in w. Show that for any two strings X,y, Lx-y is a DCFL 1. 2. Same as Question 1, but define Lwhere the number of occurrences of x,y.z in w is the same. Is Lx-y- always context-free? Explain