“…For brevity, we will call a n = 1 2 n+1 and b n = 3 2 n+2 , for all n ∈ N. Let K 0 be the extension of [0, 1] by (g n ) n∈N . Define K = K 0 ∪({0}× [1,2]) and, for each n ∈ N, consider the function f n : K −→ [0, 1] given by f n (x, t) = t, if x ∈ (a n+1 , a n ) 0, otherwise. 1, 2]).…”