C Langauge ConstraintsAll characters are alphabetical characters and a certain character won't exist more than oncein its own array (e.g. letter 'a' won't exist twice).OutputThe first line will contain a message prompt to input the number of elements in the first array.The second line will prompt for the elements of the first array.The third line will contain a message prompt to input the number of elements in the secondarray.The fourth line will prompt for the elements of the second array.The last line will contain all the unique characters all converted to lowercase, in ascendingorder (i.e. the first letter that comes in the alphabet comes first). Note that in this problem,casing doesn't matter (i.e. a small letter a is the same as a capital letter a). Furthermore, it isguaranteed that there's at least 1 unique character from the 2 arrays.Enter the number of elements in the first array: 7a.xy.d⋅s.qwEnter the number of elements in the second array: 7b.d.s-x.y.d.qUnique characters = a b w Input1. Number of elements in the first array2. Elements of the first arrayConstraintsAll characters are alphabetical characters and a certain character won't exist more than oncein its own array (e.g. letter 'a' won't exist twice).3. Number of elements in the second array4. Elements of the second arrayConstraintsAll characters are alphabetical characters and a certain character won't exist more than oncein its own array (e.g. letter 'a' won't exist twice).OutputThe first line will contain a message prompt to input the number of elements in the first array.The second line will prompt for the elements of the first array.The third line will contain a message prompt to input the number of elements in the secondarray.The fourth line will prompt for the elements of the second array.The last line will contain all the unique characters all converted to lowercase, in ascending

Nested for loops need to be used to solve this problem. Finally using selection sort the char array…

All characters are alphabetical characters and a certain character won't exist more than once in its own array (e.g. letter 'a' won't exist twice). Output The first line will contain a message prompt to input the number of elements in the first array. The second line will prompt for the elements of the first array. The third line will contain a message prompt to input the number of elements in the second array. The fourth line will prompt for the elements of the second array. The last line will contain all the unique characters all converted to lowercase, in ascending order (i.e. the first letter that comes in the alphabet comes first). Note that in this problem,