1. generally, the encoding of a TM starts with 11 and ends with the last rule in the transaction function? (11rule11rule…11rule)

2. in Q2b do we need to check if the encoding contains rules that start with the same state and read the same char (meaning duplicated rules) and if the transaction function is deterministic? meaning that there is a for every state and char except qa and qr, or is it ok to assume that if a rule from the state q and char a isn't defined then in such case it goes automatically to qreject (as assumed in class)?

3. in Q4, how does the memory look like at the beginning? meaning is it ok to assume that it contains n blanks? and if not how does the standard TM suppose to get the primary memory state?

another question about Q2: can we assume that the encoding of M ends with 111 (we can deduce from the presentation that for an input <M,w> the 111 symbols the end of M's encoding and the beginning of w)?

As I said, please write all assumptions you use.
Specifically:
Q2)
- you can assume that the input is a binary string
- yes, the encoding of a TM starts with 11 and ends with the last rule in the transaction function? (11rule11rule…11rule)
- you can assume that if a rule from the state q and char a isn't defined then in such case it goes automatically to qreject (as assumed in class)?
- the encoding of a TM does not end with 111, this is only to denote the difference between <M> and w