sir , this is very important for me . i would be really grateful to
you if you could answer this in less than 3 days.

Consider a path of n+1 (n − 2) nodes v0, v1, ， ， ， , vn each of
which demands four channels. Assume
that the node v0 and vn have already been assigned two 4-channel sets
C0 and Cn respectively.
A channel extension to the nodes v1, ， ， ， , vn−1 is a
collection of 4-channel sets C1, ， ， ， , Cn−1 such
that Ci intersection Ci+1 = &#8709; for 0 ＋ i < n. Find a channel
assignment such that |C0 union C1 union， ， ， Cn| is minimized.
(Hint: consider the &#64257;ve cases determined by the value of |C0
intersection Cn| and use the
optimal channel assignment for cycles).

---

Clarification of Question by lijo999-ga on 03 Nov 2002 09:19 PST

i am really very sorry sir because this is my second time i am sending
such a character set. well when i am posting a question there seems to
be no problem as such. i really appreciate your effort to help me out
in the 3 days. i am really grateful to you for the same.
i am providing a link to my assignment . i do not know if it would be
posted properly. it is www.cs.iit.edu slash tilda wan slash hwf023.pdf

the link to this is http://www.cs.iit.edu/~wan/hwf023.pdf

Consider a path of n+1 (n greater than or equal to 2) nodes v0, v1, to
, vn each of which demands four channels. Assume
that the node v0 and vn have already been assigned two 4-channel sets
C0 and Cn respectively.
A channel extension to the nodes v1,v2, to , vn minus 1 is a
collection of 4-channel sets C1,C2, to , Cn−1 such
that Ci intersection Ci+1 = null for 0 less than or equal to i less
than n. Find a channel assignment such that |C0 union C1 union to Cn|
is minimized. (Hint: consider the 5 cases determined by the value of
|C0 intersection Cn| and use the
optimal channel assignment for cycles).

i once again appreciate your concern sir

I have seen a questions similar (same question?) before that didn't
get answered because the character set was illegible. Although this
time around, I am nearly able to understand what you are looking for,
there are still some characters where I cannot make out their meaning.
If you must use characters that do not display well, could you provide
a link to a document (an image perhaps or a word document) where these
characters do indeed display correctly? I believe this would help
researchers greatly in attempting to answer your question.

I concur with commenter that using ASCII character set would help. In
addition, if the question is time-sensitive, it would be a good idea
to increase the price significantly; it's not very likely it will get
a rapid response at that price point.