instruction:
In this task, you are given two strings A,B. Find the longer of the two lists, convert it to lowercase, and return all the unique alphabets used in it. The two input strings are never equal.
question:
VQSpeLtiwfSAu, gmnWQlyfpeLtiwfSfySEo
answer:
e, f, g, i, l, m, n, o, p, q, s, t, w, y


question:
OySIuRRTgw, GhRIuRsJl
answer:
g, i, o, r, s, t, u, w, y


question:
hvcEPbSrAraQcKHHwOzhGwa, GTKGRdVcEPbSrAraQcKVVVYwevh
answer:

a, b, c, d, e, g, h, k, p, q, r, s, t, v, w, y