Acronyms can really obviously narrow your message sensors Because of this, you need a better way of working out if a phrase is an acronym of a word. You also think it would be worthwhile to see if the phrase and word in question are recursive acronyms.
Your task:
Given a word and then a phrase separated by a line, output if the phrase is an acronym and then if it is a recursive acronym. (The phrase contains what it stands for)

The input will compose of alphabetical characters as well as spaces.
Your program shouldn't be case sensitive.

Example Input/Output:
Case 1:
Input:
Acronyms
Acronyms can really obviously narrow your message sensors

Output:
True 
True

Case 2:
Input:
FAQ
frequently asked questions

Output:
True 
False

Case 3:
Input:
foo
bar baz

Output:
False
False

Case 4:
Input:
GNU
GNU is not Unix

Output:
False
False

Case 5:
Input:
Aha
A huge Aha

Output:
True
True
Python 3, 89

Saved a bunch of bytes thanks to SOPython.

a=input().lower()
d=input().lower().split()
h=tuple(a)==next(zip(*d))
print(h,h&amp;(a in d))


The most complicated part of this solution is h=tuple(a)==next(zip(*d)).
This unpacks the list d into zip and then calls next to return a tuple of the first element of each iterable passed into zip which is then compared against a tuple of each letter in a (tuple(a)).