need help in my Homework those are the questions:

1. let f:{0,1)^n -> {0,1}

Given that f can be computed by a Boolean circuit of a size s, describe a Boolean circuit of size 2s+n that computes f such that all NOT gates are next to Input Gates

2.

let B be the set of al Boolean function from k bits to one bit.

given that f can be computed by a boolean circuit of size s over B

describe a Boolean circuit of size O(s*2^k) that computes f over demorgan basis