What two ways does Phaethon display too much pride

English

1 answer:

Natasha_Volkova [10]3 years ago

5 0

Answer:

Phaethon believes his father is the best and is proud of where he came from and to save and savor on that pride, he lies about him and his father

Explanation:

In a Phaeton text, it states, " 8 “Sometimes I visit my father,” said Epaphus,3

the other boy. “I sit on

Olympus4

with him, and he teaches me things and gives me presents. Know what

he gave me last time? A little thunderbolt just like his—and he taught me how to

throw it. I killed three vultures, scared a f shing boat, started a forest f re. Next time

I go, I’ll throw it at more things. Do you visit your father?”

9 Phaethon never had. But he could not bear to tell Epaphus. “Certainly,” he said,

“very of en. I go to the eastern palace, and he teaches me things too.”

Which is lying for pride and respect from others, himself, and his father.

The second states, " 7 “Without my father there would be no day. It would always be night. Each

morning he hitches up his horses and drives the golden chariot of the sun across the

sky. And that is day time. T en he dives into the ocean stream and boards a golden

ferryboat and sails back to his eastern palace. T at time is called night."

You might be interested in

Read the poem.

Goryan [66]

Structure is used to create an order of events as the words 'sky was dim' suggest that it was dawn preceding the 5th line which states that the 'morning arrived' which shows a sequence of events such as dawn before morning.

6 0

3 years ago

Please! Someone help me:(

Nat2105 [25]

Answer:D Earth’s magnetic field reduces the power

Explanation:

7 0

3 years ago

Read 2 more answers

Given a non-empty string s and a dictionary containing a list of unique words, design a dynamic programming algorithm to determi

nlexa [21]

Let s(i),k denote the substring s(i)s(i+1)...s k. Let Opt(k) denote whether the sub-string s1,k can be segmented using the words in the dictionary, namely (k) =1 if the segmentation is possible and 0 otherwise. A segmentation of this sub-string s1,k is possible if only the last word (say si k) is in the dictionary theremaining substring s1,i can be segmented.
Therefore, we have equation:Opt(k) = max Opt(i) 0<i<k and s(i+1),kis a word in the dictionary
We can begin solving the above recurrence with the initial condition that Opt(0) =1 and then go on to comput eOpt(k) for k= 1, 2. The answer correspond-ing to Opt(n) is the solution and can be computed in Θ(n2) time.