Recall that {0,1}∗denotes the set of all bit-strings of any finite length. A language is a collection of bit-strings, i. e. a subset ⊆{0,1}∗. Let (x) be an algorithm whose input is abit-string x∈{0,1}∗, and whose output is 0 or 1.

Define what it means for a language L to be accepted by A.

answer:

i lost in getting someone back.

i learned that people are really two-faced and no matter how angelic someone appears they always have a devil side and that you cant trust anyone anymore no matter how dear they are to you.

if your wondering who it waz it waz mah still miss her tho

~batmans wife dun dun

answer:

i am not 100% sure but i think it is a.)

dont take my word for it

explanation: