Both 1 and 2 are CFL.
as both can be accepted by using push down automata.
Language 1 generates the strings of type xy ,xxyy, xxxyyy and so on which can be accepted by pushing all x into the stack and then for every y pop one x out of the stack .
Language 2 generates the strings of type x#y, xx#yy, xxx#yyy and so on which can be accepted by pushing all x into the stack after that we have to skip the # and then for every y we have to pop one x out of the stack.
In both cases the PDA accepts the string with empty stack .