Not a multiple choice question, please check if my answers are correct

The Kleene Star of a set is O The set of all strings of any length over . O The set of all strings of length 1 or more over 2. Denoted ?+ (e) The set of strings consisting of repeating some number of times, where z e ? QUESTION 4 Which of the following languages is regular? O The binary encodings of all correct Python programs. The language consisting of all strings over fa, by that have an equal number of a's as b's. O The language consisting of all bit strings with only 1's. O The language of matched paretheses: e, 0,00, (O),..)