(i)

(ii)

(iii)

(iv)

(v)

(vi)

B = (5.42, 3.84)
f = Line(B, xAxis)
g = OrthogonalLine(B, f)
C_1 = (-4.48, 3.02)
k = Line(C_1, yAxis)
E_1 = Point(k)
m = OrthogonalLine(E_1, k)
H_1 = Point(m)
l = OrthogonalLine(C_1, k)
F = Point(l)
G = Point(Ray[B, Vector[(0, -1)]])
p = Segment(G, B)
A = Point(Ray[B, Vector[(1, 0)]])
h_1 = Line(G, A)
q = Segment(B, A)
r = Segment(A, G)
E = Segment(C_1, F)
Z = Segment(E_1, H_1)
I = Point(k)
D = Point(p)
h_2 = OrthogonalLine(D, h_1)
C_2 = Intersect(h_1, h_2)
Q1 = Point(Segment[C_2, A])
Q2 = Point(Segment[G, C_2])
i = Line(Q2, D)
j = Line(Q1, D)
T1 = Intersect(j, f)
T2 = Intersect(i, f)
a: abs(Distance[T1, Q1] / Distance[Q1, G] - Distance[C_1, F] / Distance[E_1, H_1])
Q = Minimize(a, Q1)
b: abs(Distance[T2, Q2] / Distance[Q2, G] - Distance[C_1, F] / Distance[E_1, H_1])
Q' = Minimize(b, Q2)
n = Line(Q, D)
s = Line(Q', D)
T = Intersect(f, n)
T' = Intersect(s, f)
t = Line(D, f)
M = Intersect(h_1, t)
c = Segment(D, M)
d = Segment(D, A)
e = Circle(D, M, G)
f_1 = Line(M, d)
C = Intersect(e, f_1, 2)
g_1 = Segment(C, M)
h: (Distance[A, D] * Distance[E_1, H_1] / Distance[C_1, F])
J: I + (h, 0)
H = Segment(I, J)
i_1 = Line(C, Q)
N' = Intersect(e, s, 2)
j_1 = Segment(C, N')
N = Intersect(e, n, 2)
k_1 = Segment(C, N)
l_1 = Segment(N, T)
m_1 = Segment(N', T')
n_1 = Segment(T', B)
p_1 = Segment(T, B)
L' = Intersect(r, j_1)
L = Intersect(r, k_1)
s_1: abs(Distance[T, Q] / Distance[Q, G] - Distance[C_1, F] / Distance[E_1, H_1])
s_2: abs(Distance[T', Q'] / Distance[Q', G] - Distance[C_1, F] / Distance[E_1, H_1])
o = false
u = false
v = false
w = false
a_1 = false
b_1 = false