Given that s_n denotes the number of n-bit strings that do not contain the pattern 00, what is the recurrence relation?

g = (2, 2)

step-by-step explanation:

given the ratio is 1 : 1 then f is the midpoint of eg

let the coordinates of g = (x, y)

using the midpoint formula

(0 + x) = 1 ( multiply both sides by 2 )

0 + x = 2 ⇒ x = 2

similarly

(4 + y) = 3 ( multiply both sides by 2 )

4 + y = 6 ( subtract 4 from both sides )

y = 2

coordinates of g = (2, 2)

false

step-by-step explanation:

rulers and compasses arent required in order to bisect an angle because when bisecting angles, you're making a "half circle" and considering in order to bisect an angle it wouldn't be straight, you wouldn't need either of the two