程序代写代做代考 ## Q1

## Q1
(inc . triple) 5 == 16 True
(triple . inc) 10 == 18 False
map inc[“1”] == [“2”] False
map triple [2, 5, 6] == [6, 15, 18] True
(inc . inc) … equivalen True
(triple . triple) … False
(triple . inc) (inc . triple) False
the type of …. False
the type of (map triple) is …. True

## Q5
i)
not syntactically correct

ii)
syntactically correct, not sensiblely typed

iii)
well-formed bool

iv)
well-formed Num a => [a -> a -> a]

v)
well formed [[[[t]]]] 最后1个

vi)
syntactically correct, not sensiblely typed

vii)
well formed [Char]

## Q6
i) O(n^2)

ii) The append operation (++) is O(n): linear time and there are n recursive calls.

iii) O(n)

iv) 第1个