Each of the letters of “answer” can be translated into binary in the standard way (A1Z26 then base 10 to binary), yielding:
A - 00001
N - 01110
S - 10011
W - 10111
E - 00101
R - 10010
These binary strings can be matched to the cats above them. Through a bit of logic, each of the binary digits can be matched to a trait of the cats:
First digit - Fluffy?
Second digit - Starred?
Third digit - Striped?
Fourth digit - Wide eyed?
Fifth digit - Tiny little guy?
With this list, the bottom row can be translated into binary, and then text:
00110 - F
10010 - R
01111 - O
10101 - U
11010 - Z
01001 - I
00101 - E
10011 - S
10100 - T
Which gives our answer, FROUZIEST.