For the above question we can see that for all options, properties satisfied by the strings could be defined as some relation between x and y alphabets.
For Grammar 1, Strings with a combination of both x and y can be generated with the following form of production(s) of the grammar only.
S–>xS –>xyB or
S–>zS–>zxS–>zxyB
(In case starting production is S–>x| z| yB, it cannot give both x and y in the string)
Hence in any string with x and y both no y can appear before x can be described as a property satisfied by the strings of the language.
Similarly for Grammar 2, Strings with a combination of both x and y can be generated with the following
form of production(s) of the grammar only.