What spell can disguise a PC as a particular Yuan-ti?

We killed a Yuan-ti. Now we want to infiltrate their base disguised as one of the Yuan-ti we killed.

The PHB Page 211, Alter Self spell states:

You assume a different form. When you cast the spell, choose one of the following options, the effects of which last for the duration of the spell. While the spell lasts, you can end one option as an action to gain the benefits of a different one.

Change Appearance. You transform your appearance. You decide what you look like, including your height, weight, facial features, sound of your voice, hair length, coloration, and distinguishing characteristics, if any. You can make yourself appear as a member of another race, though none of your statistics change. You also can’t appear as a creature of a different size than you, and your basic shape stays the same; if you’re bipedal, you can’t use this spell to become quadrupedal, for instance. At any time for the duration of the spell, you can use your action to change your appearance in this way again.

One would assume that Yuan-ti’s are a "different" form due to the snake torso.

Disguise Self is also too limited. Polymorph only covers beasts.

What can be done if, as a wizard, you are trying to disguise yourself as a particular Yuan-ti you met on an adventure (that is now dead)?

In what cases is solving Binary Linear Program easy (i.e. **P** complexity)? I’m looking at scheduling problems in particular

In what cases is solving Binary Linear Program easy (i.e. P complexity)?

The reason I’m asking is to understand if I can reformulate a scheduling problem I’m currently working on in such a way to guarantee finding the global optimum within reasonable time, so any advice in that direction is most welcome.

I was under the impression that when solving a scheduling problem, where a variable value of 1 represents that a particular (timeslot x person) pair is part of the schedule, if the result contains non-integers, that means that there exist multiple valid schedules, and the result is a linear combination of such schedules; to obtain a valid integer solution, one simply needs to re-run the algorithm from the current solution, with an additional constraint for one of the real-valued variables equal to either 0 or 1.

Am I mistaken in this understanding? Is there a particular subset of (scheduling) problems where this would be a valid strategy? Any papers / textbook chapter suggestions are most welcome also.

Constructing a monad via type synonyms of a particular kind

We can define a reader/environment monad on the simply-typed lambda calculus, using the following three equations, where $ r$ is some fixed type, $ \alpha$ is any type (I subscript some terms with their types), $ \mathbb{M}$ is the proposed monadic type modality), $ \eta$ is the unit of the monad and $ \mu:\mathbb{M} \mathbb{M}\alpha → \mathbb{M}\alpha$ is the join of the monad:

$ $ \mathbb{M} \thinspace α = r → α \hspace{1cm} ∀α$ $ $ $ \eta \, a_{\alpha} = \lambda c_{r}.\; a \hspace{2cm} ∀a_{\alpha}$ $ $ $ \mu\,b_{\mathbb{M}\mathbb{M} \alpha} = λc_{r}.\; b_{\mathbb{M}\mathbb{M}\alpha}\, c\, c \hspace{1cm} ∀b_{\mathbb{M}\mathbb{M} \alpha} $ $

Can we always construct a reader monad by type synonyms of the form $ r = x$ , for arbitrary function types $ x$ (for example, where $ x$ is $ (\beta \to t) \to t$ ), for some type $ \beta$ ?

In an Arm TrustZone based Trusted Application (TA), how can a remote party tie an output to a particular TA?

I’ve been looking at the following figure which shows, with Arm TrustZone architecture, resources of a system can be divided into a Rich Execution Environment (REE) and a Trusted Execution Environment (TEE).

enter image description here

Here I’m trying to understand the following: Suppose a remote party wants a particular trusted application (TA) running in TEE to do some computation on his input. How can this remote party be ensured that the computation is actually done by the correct TA ?