Hello I didnt understand some parts of the question:

in general: you set the function "no" to be a function that never returns.

can I assume that any other function that never returns, "g", is equivalent to "no", thus f(g)=f(no) for each g like this?

b. what is " What is the reduction implemented by halt above ?"

what do you mean by implemented?

if I can construct a mapping reduction using some of the element in function "halt" is that count?

it is really not clear what is the question.

and if I want to state L(c) = all the functions f that C(f) = true is that possible to use L(c) in the reduction?

d.what do you mean by "state"? what should I answer here?

we just showed that we can decide the halting problem for python languages…

so how can we talk about rice theorem while it is proved by the assumption that the halting problem is not decidable.

can you please elaborate and try to make it clear?

thanks alot