Please help.

Please help on both

COMPLETE THREE-VIEW ORTHOGRAPHIC SKETCHES OF THE FOLLOWING OBJECTS USE ORTHO GRID PAPER. Drawn By:

No chatgpt pls will upvote

2 Q/ Let d₂ +d, di, d2: R² XR² R² defined as follow ((x+x), (2, 1) = √(x-2)² + (x_wx • d₁ ((x,y), (z, w)) = max {1x-z\, \y-w\} • 1 1 dq ((x,y), (Z, W)) = \ x=2\+\-w| 2 • show that dod₁, d₂ are equivalent? 2

2 +d, di, d2: R² XR² > R² defined as follow Q/ Let d₂ 2/ d((x+x), (2, 1)) = √(x-2)² + (x-wsc • d₁ ((x,y), (z, w)) = max {| x-z\, \y-w\} • d₂ ((x, y), (Z, W)) = 1x-21+ \y-w| 2 • show that ddi, d₂ are equivalent? އ

Numerical an

1. Prove the following arguments using the rules of inference. Do not make use of conditional proof. (а) а → (ЪЛс) ¬C ..¬a (b) (pVq) → →r יור (c) (c^h) → j ¬j h (d) s→ d t d -d ..8A-t (e) (pVg) (rv¬s) Лѕ קר .'

2. Consider the following argument: (a) Seabiscuit is a thoroughbred. Seabiscuit is very fast. Every very fast racehorse can win the race. .. Therefore, some thoroughbred racehorse can win the race. Let us define the following predicates, whose domain is racehorses: T(x) x is a thoroughbred F(x) x is very fast R(x) x can win the race : Write the above argument in logical symbols using these predicates. (b) Prove the argument using the rules of inference. Do not make use of conditional proof. (c) Rewrite the proof using full sentences, avoiding logical symbols. It does not need to mention the names of rules of inference, but a fellow CSE 16 student should be able to understand the logical reasoning.